/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/prodbin-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:55:25,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:55:25,212 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:55:25,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:55:25,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:55:25,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:55:25,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:55:25,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:55:25,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:55:25,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:55:25,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:55:25,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:55:25,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:55:25,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:55:25,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:55:25,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:55:25,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:55:25,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:55:25,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:55:25,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:55:25,305 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:55:25,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:55:25,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:55:25,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:55:25,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:55:25,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:55:25,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:55:25,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:55:25,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:55:25,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:55:25,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:55:25,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:55:25,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:55:25,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:55:25,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:55:25,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:55:25,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:55:25,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:55:25,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:55:25,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:55:25,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:55:25,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:55:25,322 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:55:25,356 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:55:25,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:55:25,357 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:55:25,357 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:55:25,357 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:55:25,357 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:55:25,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:55:25,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:55:25,358 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:55:25,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:55:25,359 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:55:25,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:55:25,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:55:25,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:55:25,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:55:25,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:55:25,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:55:25,360 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:55:25,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:55:25,360 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:55:25,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:55:25,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:55:25,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:55:25,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:55:25,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:55:25,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:55:25,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:55:25,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:55:25,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:55:25,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:55:25,362 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:55:25,362 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:55:25,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:55:25,362 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 11:55:25,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:55:25,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:55:25,589 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:55:25,590 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:55:25,591 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:55:25,592 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/prodbin-ll.c [2022-04-27 11:55:25,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa881fcbe/52746738270a4b08bf5976c393dd3e2f/FLAGea121c7ec [2022-04-27 11:55:26,114 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:55:26,115 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prodbin-ll.c [2022-04-27 11:55:26,128 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa881fcbe/52746738270a4b08bf5976c393dd3e2f/FLAGea121c7ec [2022-04-27 11:55:26,147 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa881fcbe/52746738270a4b08bf5976c393dd3e2f [2022-04-27 11:55:26,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:55:26,151 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:55:26,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:55:26,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:55:26,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:55:26,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:55:26" (1/1) ... [2022-04-27 11:55:26,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28122727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:55:26, skipping insertion in model container [2022-04-27 11:55:26,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:55:26" (1/1) ... [2022-04-27 11:55:26,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:55:26,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:55:26,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prodbin-ll.c[537,550] [2022-04-27 11:55:26,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:55:26,365 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:55:26,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prodbin-ll.c[537,550] [2022-04-27 11:55:26,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:55:26,392 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:55:26,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:55:26 WrapperNode [2022-04-27 11:55:26,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:55:26,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:55:26,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:55:26,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:55:26,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:55:26" (1/1) ... [2022-04-27 11:55:26,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:55:26" (1/1) ... [2022-04-27 11:55:26,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:55:26" (1/1) ... [2022-04-27 11:55:26,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:55:26" (1/1) ... [2022-04-27 11:55:26,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:55:26" (1/1) ... [2022-04-27 11:55:26,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:55:26" (1/1) ... [2022-04-27 11:55:26,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:55:26" (1/1) ... [2022-04-27 11:55:26,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:55:26,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:55:26,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:55:26,423 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:55:26,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:55:26" (1/1) ... [2022-04-27 11:55:26,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:55:26,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:55:26,461 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 11:55:26,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 11:55:26,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:55:26,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:55:26,502 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:55:26,503 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:55:26,505 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:55:26,505 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:55:26,505 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:55:26,505 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:55:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:55:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:55:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:55:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:55:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:55:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:55:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:55:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:55:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:55:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:55:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:55:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:55:26,570 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:55:26,571 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:55:26,742 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:55:26,748 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:55:26,749 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:55:26,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:55:26 BoogieIcfgContainer [2022-04-27 11:55:26,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:55:26,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:55:26,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:55:26,772 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:55:26,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:55:26" (1/3) ... [2022-04-27 11:55:26,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3379eb13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:55:26, skipping insertion in model container [2022-04-27 11:55:26,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:55:26" (2/3) ... [2022-04-27 11:55:26,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3379eb13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:55:26, skipping insertion in model container [2022-04-27 11:55:26,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:55:26" (3/3) ... [2022-04-27 11:55:26,775 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll.c [2022-04-27 11:55:26,792 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:55:26,793 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:55:26,834 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:55:26,840 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@224e042d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ef3db6c [2022-04-27 11:55:26,840 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:55:26,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 11:55:26,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:55:26,860 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:55:26,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:55:26,861 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:55:26,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:55:26,866 INFO L85 PathProgramCache]: Analyzing trace with hash 2112761405, now seen corresponding path program 1 times [2022-04-27 11:55:26,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:55:26,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574848934] [2022-04-27 11:55:26,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:55:26,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:55:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:27,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:55:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:27,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 11:55:27,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 11:55:27,099 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #64#return; {32#true} is VALID [2022-04-27 11:55:27,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:55:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:27,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 11:55:27,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 11:55:27,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 11:55:27,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #58#return; {33#false} is VALID [2022-04-27 11:55:27,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:55:27,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-27 11:55:27,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-27 11:55:27,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #64#return; {32#true} is VALID [2022-04-27 11:55:27,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-27 11:55:27,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {32#true} is VALID [2022-04-27 11:55:27,140 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {32#true} is VALID [2022-04-27 11:55:27,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-27 11:55:27,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-27 11:55:27,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-27 11:55:27,141 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #58#return; {33#false} is VALID [2022-04-27 11:55:27,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {33#false} is VALID [2022-04-27 11:55:27,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-27 11:55:27,142 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {33#false} is VALID [2022-04-27 11:55:27,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-27 11:55:27,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-27 11:55:27,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-27 11:55:27,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:55:27,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:55:27,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574848934] [2022-04-27 11:55:27,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574848934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:55:27,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:55:27,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:55:27,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712156154] [2022-04-27 11:55:27,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:55:27,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:55:27,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:55:27,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:55:27,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:55:27,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:55:27,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:55:27,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:55:27,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:55:27,226 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:55:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:55:27,354 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2022-04-27 11:55:27,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:55:27,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:55:27,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:55:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:55:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-04-27 11:55:27,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:55:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-04-27 11:55:27,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2022-04-27 11:55:27,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:55:27,506 INFO L225 Difference]: With dead ends: 49 [2022-04-27 11:55:27,506 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 11:55:27,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:55:27,512 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:55:27,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:55:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 11:55:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 11:55:27,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:55:27,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:55:27,555 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:55:27,555 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:55:27,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:55:27,558 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-27 11:55:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 11:55:27,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:55:27,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:55:27,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-04-27 11:55:27,560 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-04-27 11:55:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:55:27,562 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-27 11:55:27,563 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 11:55:27,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:55:27,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:55:27,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:55:27,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:55:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 11:55:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-27 11:55:27,567 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2022-04-27 11:55:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:55:27,567 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-27 11:55:27,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:55:27,568 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-27 11:55:27,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:55:27,568 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:55:27,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:55:27,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:55:27,569 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:55:27,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:55:27,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1500360061, now seen corresponding path program 1 times [2022-04-27 11:55:27,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:55:27,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140124145] [2022-04-27 11:55:27,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:55:27,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:55:27,593 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:55:27,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [660802116] [2022-04-27 11:55:27,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:55:27,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:55:27,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:55:27,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:55:27,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 11:55:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:27,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 11:55:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:27,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:55:27,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {189#true} is VALID [2022-04-27 11:55:27,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {189#true} is VALID [2022-04-27 11:55:27,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#true} assume true; {189#true} is VALID [2022-04-27 11:55:27,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189#true} {189#true} #64#return; {189#true} is VALID [2022-04-27 11:55:27,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {189#true} call #t~ret6 := main(); {189#true} is VALID [2022-04-27 11:55:27,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {189#true} is VALID [2022-04-27 11:55:27,896 INFO L272 TraceCheckUtils]: 6: Hoare triple {189#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {189#true} is VALID [2022-04-27 11:55:27,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {189#true} ~cond := #in~cond; {189#true} is VALID [2022-04-27 11:55:27,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {189#true} assume !(0 == ~cond); {189#true} is VALID [2022-04-27 11:55:27,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {189#true} assume true; {189#true} is VALID [2022-04-27 11:55:27,897 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {189#true} {189#true} #58#return; {189#true} is VALID [2022-04-27 11:55:27,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {189#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {227#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 11:55:27,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {227#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {227#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 11:55:27,900 INFO L272 TraceCheckUtils]: 13: Hoare triple {227#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {234#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:55:27,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {234#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {238#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:55:27,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {238#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {190#false} is VALID [2022-04-27 11:55:27,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {190#false} assume !false; {190#false} is VALID [2022-04-27 11:55:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:55:27,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:55:27,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:55:27,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140124145] [2022-04-27 11:55:27,902 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:55:27,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660802116] [2022-04-27 11:55:27,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660802116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:55:27,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:55:27,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:55:27,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983535700] [2022-04-27 11:55:27,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:55:27,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:55:27,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:55:27,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:55:27,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:55:27,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:55:27,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:55:27,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:55:27,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:55:27,921 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:55:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:55:28,067 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-27 11:55:28,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:55:28,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 11:55:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:55:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:55:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 11:55:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:55:28,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 11:55:28,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-27 11:55:28,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:55:28,115 INFO L225 Difference]: With dead ends: 36 [2022-04-27 11:55:28,116 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 11:55:28,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:55:28,118 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:55:28,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:55:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 11:55:28,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-04-27 11:55:28,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:55:28,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:55:28,130 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:55:28,131 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:55:28,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:55:28,133 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 11:55:28,134 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 11:55:28,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:55:28,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:55:28,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 11:55:28,135 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 11:55:28,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:55:28,137 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 11:55:28,137 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 11:55:28,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:55:28,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:55:28,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:55:28,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:55:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:55:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-27 11:55:28,140 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-27 11:55:28,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:55:28,140 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-27 11:55:28,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 11:55:28,141 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-27 11:55:28,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:55:28,141 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:55:28,142 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:55:28,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 11:55:28,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:55:28,367 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:55:28,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:55:28,368 INFO L85 PathProgramCache]: Analyzing trace with hash 966896435, now seen corresponding path program 1 times [2022-04-27 11:55:28,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:55:28,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190771602] [2022-04-27 11:55:28,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:55:28,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:55:28,382 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:55:28,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2126177139] [2022-04-27 11:55:28,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:55:28,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:55:28,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:55:28,384 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:55:28,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 11:55:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:28,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:55:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:28,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:55:28,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {407#true} call ULTIMATE.init(); {407#true} is VALID [2022-04-27 11:55:28,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {407#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {407#true} is VALID [2022-04-27 11:55:28,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {407#true} assume true; {407#true} is VALID [2022-04-27 11:55:28,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {407#true} {407#true} #64#return; {407#true} is VALID [2022-04-27 11:55:28,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {407#true} call #t~ret6 := main(); {407#true} is VALID [2022-04-27 11:55:28,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {407#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {407#true} is VALID [2022-04-27 11:55:28,628 INFO L272 TraceCheckUtils]: 6: Hoare triple {407#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {407#true} is VALID [2022-04-27 11:55:28,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {407#true} ~cond := #in~cond; {433#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:55:28,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {433#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {437#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:55:28,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {437#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {437#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:55:28,636 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {437#(not (= |assume_abort_if_not_#in~cond| 0))} {407#true} #58#return; {444#(<= 1 main_~b~0)} is VALID [2022-04-27 11:55:28,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {444#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {448#(<= 1 main_~y~0)} is VALID [2022-04-27 11:55:28,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {448#(<= 1 main_~y~0)} assume !false; {448#(<= 1 main_~y~0)} is VALID [2022-04-27 11:55:28,639 INFO L272 TraceCheckUtils]: 13: Hoare triple {448#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {407#true} is VALID [2022-04-27 11:55:28,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {407#true} ~cond := #in~cond; {407#true} is VALID [2022-04-27 11:55:28,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {407#true} assume !(0 == ~cond); {407#true} is VALID [2022-04-27 11:55:28,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {407#true} assume true; {407#true} is VALID [2022-04-27 11:55:28,641 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {407#true} {448#(<= 1 main_~y~0)} #60#return; {448#(<= 1 main_~y~0)} is VALID [2022-04-27 11:55:28,643 INFO L290 TraceCheckUtils]: 18: Hoare triple {448#(<= 1 main_~y~0)} assume !(0 != ~y~0); {408#false} is VALID [2022-04-27 11:55:28,643 INFO L272 TraceCheckUtils]: 19: Hoare triple {408#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {408#false} is VALID [2022-04-27 11:55:28,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {408#false} ~cond := #in~cond; {408#false} is VALID [2022-04-27 11:55:28,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {408#false} assume 0 == ~cond; {408#false} is VALID [2022-04-27 11:55:28,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {408#false} assume !false; {408#false} is VALID [2022-04-27 11:55:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:55:28,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:55:28,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:55:28,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190771602] [2022-04-27 11:55:28,646 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:55:28,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126177139] [2022-04-27 11:55:28,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126177139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:55:28,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:55:28,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:55:28,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721561590] [2022-04-27 11:55:28,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:55:28,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 11:55:28,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:55:28,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:55:28,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:55:28,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:55:28,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:55:28,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:55:28,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:55:28,672 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:55:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:55:28,836 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-27 11:55:28,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:55:28,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 11:55:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:55:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:55:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-27 11:55:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:55:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-27 11:55:28,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-27 11:55:28,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:55:28,892 INFO L225 Difference]: With dead ends: 40 [2022-04-27 11:55:28,893 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 11:55:28,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:55:28,897 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:55:28,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 77 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:55:28,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 11:55:28,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-04-27 11:55:28,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:55:28,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:55:28,915 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:55:28,915 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:55:28,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:55:28,920 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 11:55:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 11:55:28,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:55:28,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:55:28,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-27 11:55:28,921 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-27 11:55:28,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:55:28,923 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-27 11:55:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-27 11:55:28,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:55:28,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:55:28,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:55:28,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:55:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 11:55:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-27 11:55:28,925 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 23 [2022-04-27 11:55:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:55:28,926 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-27 11:55:28,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:55:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-27 11:55:28,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 11:55:28,927 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:55:28,927 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:55:28,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 11:55:29,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 11:55:29,136 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:55:29,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:55:29,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1614734214, now seen corresponding path program 1 times [2022-04-27 11:55:29,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:55:29,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125534313] [2022-04-27 11:55:29,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:55:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:55:29,150 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:55:29,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [476126528] [2022-04-27 11:55:29,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:55:29,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:55:29,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:55:29,157 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:55:29,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 11:55:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:29,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-27 11:55:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:29,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:55:31,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {650#true} call ULTIMATE.init(); {650#true} is VALID [2022-04-27 11:55:31,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {650#true} is VALID [2022-04-27 11:55:31,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {650#true} assume true; {650#true} is VALID [2022-04-27 11:55:31,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {650#true} {650#true} #64#return; {650#true} is VALID [2022-04-27 11:55:31,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {650#true} call #t~ret6 := main(); {650#true} is VALID [2022-04-27 11:55:31,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {650#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {650#true} is VALID [2022-04-27 11:55:31,867 INFO L272 TraceCheckUtils]: 6: Hoare triple {650#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {650#true} is VALID [2022-04-27 11:55:31,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {650#true} ~cond := #in~cond; {676#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:55:31,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {676#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {680#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:55:31,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {680#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {680#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:55:31,870 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {680#(not (= |assume_abort_if_not_#in~cond| 0))} {650#true} #58#return; {687#(<= 1 main_~b~0)} is VALID [2022-04-27 11:55:31,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {687#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {691#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 11:55:31,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {691#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {691#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 11:55:31,881 INFO L272 TraceCheckUtils]: 13: Hoare triple {691#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {650#true} is VALID [2022-04-27 11:55:31,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {650#true} ~cond := #in~cond; {650#true} is VALID [2022-04-27 11:55:31,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {650#true} assume !(0 == ~cond); {650#true} is VALID [2022-04-27 11:55:31,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {650#true} assume true; {650#true} is VALID [2022-04-27 11:55:31,886 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {650#true} {691#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #60#return; {691#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 11:55:31,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {691#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {691#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 11:55:31,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {691#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {716#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 11:55:31,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {716#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {720#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-27 11:55:31,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {720#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {720#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-27 11:55:31,892 INFO L272 TraceCheckUtils]: 22: Hoare triple {720#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:55:31,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:55:31,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {651#false} is VALID [2022-04-27 11:55:31,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {651#false} assume !false; {651#false} is VALID [2022-04-27 11:55:31,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:55:31,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:56:00,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {651#false} assume !false; {651#false} is VALID [2022-04-27 11:56:00,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {651#false} is VALID [2022-04-27 11:56:00,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:00,791 INFO L272 TraceCheckUtils]: 22: Hoare triple {747#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:00,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {747#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {747#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 11:56:00,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {754#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {747#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 11:56:00,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {758#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {754#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-27 11:56:00,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {758#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {758#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-27 11:56:00,803 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {650#true} {758#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} #60#return; {758#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-27 11:56:00,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {650#true} assume true; {650#true} is VALID [2022-04-27 11:56:00,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {650#true} assume !(0 == ~cond); {650#true} is VALID [2022-04-27 11:56:00,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {650#true} ~cond := #in~cond; {650#true} is VALID [2022-04-27 11:56:00,804 INFO L272 TraceCheckUtils]: 13: Hoare triple {758#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {650#true} is VALID [2022-04-27 11:56:00,804 INFO L290 TraceCheckUtils]: 12: Hoare triple {758#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !false; {758#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-27 11:56:00,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {758#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-27 11:56:00,810 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {680#(not (= |assume_abort_if_not_#in~cond| 0))} {650#true} #58#return; {783#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-27 11:56:00,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {680#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {680#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:56:00,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {796#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {680#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:56:00,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {650#true} ~cond := #in~cond; {796#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 11:56:00,811 INFO L272 TraceCheckUtils]: 6: Hoare triple {650#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {650#true} is VALID [2022-04-27 11:56:00,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {650#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {650#true} is VALID [2022-04-27 11:56:00,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {650#true} call #t~ret6 := main(); {650#true} is VALID [2022-04-27 11:56:00,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {650#true} {650#true} #64#return; {650#true} is VALID [2022-04-27 11:56:00,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {650#true} assume true; {650#true} is VALID [2022-04-27 11:56:00,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {650#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {650#true} is VALID [2022-04-27 11:56:00,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {650#true} call ULTIMATE.init(); {650#true} is VALID [2022-04-27 11:56:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:56:00,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:00,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125534313] [2022-04-27 11:56:00,813 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:00,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476126528] [2022-04-27 11:56:00,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476126528] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:56:00,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:56:00,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-04-27 11:56:00,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203826607] [2022-04-27 11:56:00,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:56:00,814 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 26 [2022-04-27 11:56:00,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:00,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:56:00,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:00,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 11:56:00,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:00,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 11:56:00,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:56:00,863 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:56:02,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:02,740 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2022-04-27 11:56:02,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 11:56:02,741 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 26 [2022-04-27 11:56:02,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:56:02,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 68 transitions. [2022-04-27 11:56:02,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:56:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 68 transitions. [2022-04-27 11:56:02,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 68 transitions. [2022-04-27 11:56:02,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:02,835 INFO L225 Difference]: With dead ends: 60 [2022-04-27 11:56:02,835 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 11:56:02,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-04-27 11:56:02,836 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 34 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:02,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 150 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 11:56:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 11:56:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-04-27 11:56:02,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:02,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 51 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:56:02,859 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 51 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:56:02,860 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 51 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:56:02,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:02,869 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-27 11:56:02,869 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-04-27 11:56:02,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:02,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:02,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 53 states. [2022-04-27 11:56:02,876 INFO L87 Difference]: Start difference. First operand has 51 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 53 states. [2022-04-27 11:56:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:02,883 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-27 11:56:02,883 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-04-27 11:56:02,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:02,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:02,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:02,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:56:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-27 11:56:02,892 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 26 [2022-04-27 11:56:02,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:02,892 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-27 11:56:02,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 12 states have internal predecessors, (26), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 11:56:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-27 11:56:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 11:56:02,893 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:02,893 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:02,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 11:56:03,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:03,094 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:03,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:03,095 INFO L85 PathProgramCache]: Analyzing trace with hash 730472692, now seen corresponding path program 1 times [2022-04-27 11:56:03,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:03,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635243064] [2022-04-27 11:56:03,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:03,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:03,121 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:56:03,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1602148799] [2022-04-27 11:56:03,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:03,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:03,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:03,122 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:56:03,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 11:56:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:03,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 11:56:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:03,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:56:13,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {1092#true} call ULTIMATE.init(); {1092#true} is VALID [2022-04-27 11:56:13,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {1092#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1092#true} is VALID [2022-04-27 11:56:13,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {1092#true} assume true; {1092#true} is VALID [2022-04-27 11:56:13,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1092#true} {1092#true} #64#return; {1092#true} is VALID [2022-04-27 11:56:13,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {1092#true} call #t~ret6 := main(); {1092#true} is VALID [2022-04-27 11:56:13,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {1092#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1092#true} is VALID [2022-04-27 11:56:13,341 INFO L272 TraceCheckUtils]: 6: Hoare triple {1092#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1092#true} is VALID [2022-04-27 11:56:13,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {1092#true} ~cond := #in~cond; {1092#true} is VALID [2022-04-27 11:56:13,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {1092#true} assume !(0 == ~cond); {1092#true} is VALID [2022-04-27 11:56:13,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {1092#true} assume true; {1092#true} is VALID [2022-04-27 11:56:13,341 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1092#true} {1092#true} #58#return; {1092#true} is VALID [2022-04-27 11:56:13,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {1092#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1092#true} is VALID [2022-04-27 11:56:13,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {1092#true} assume !false; {1092#true} is VALID [2022-04-27 11:56:13,342 INFO L272 TraceCheckUtils]: 13: Hoare triple {1092#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1092#true} is VALID [2022-04-27 11:56:13,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {1092#true} ~cond := #in~cond; {1092#true} is VALID [2022-04-27 11:56:13,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {1092#true} assume !(0 == ~cond); {1092#true} is VALID [2022-04-27 11:56:13,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {1092#true} assume true; {1092#true} is VALID [2022-04-27 11:56:13,342 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1092#true} {1092#true} #60#return; {1092#true} is VALID [2022-04-27 11:56:13,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {1092#true} assume !!(0 != ~y~0); {1092#true} is VALID [2022-04-27 11:56:13,343 INFO L290 TraceCheckUtils]: 19: Hoare triple {1092#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1092#true} is VALID [2022-04-27 11:56:13,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {1092#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1092#true} is VALID [2022-04-27 11:56:13,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {1092#true} assume !false; {1092#true} is VALID [2022-04-27 11:56:13,343 INFO L272 TraceCheckUtils]: 22: Hoare triple {1092#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1092#true} is VALID [2022-04-27 11:56:13,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {1092#true} ~cond := #in~cond; {1166#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:13,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {1166#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:56:13,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {1170#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:56:15,348 WARN L284 TraceCheckUtils]: 26: Hoare quadruple {1170#(not (= |__VERIFIER_assert_#in~cond| 0))} {1092#true} #60#return; {1177#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} is UNKNOWN [2022-04-27 11:56:15,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {1177#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} assume !(0 != ~y~0); {1181#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-27 11:56:15,349 INFO L272 TraceCheckUtils]: 28: Hoare triple {1181#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1185#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:15,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {1185#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1189#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:15,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {1189#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1093#false} is VALID [2022-04-27 11:56:15,350 INFO L290 TraceCheckUtils]: 31: Hoare triple {1093#false} assume !false; {1093#false} is VALID [2022-04-27 11:56:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:56:15,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:56:32,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {1093#false} assume !false; {1093#false} is VALID [2022-04-27 11:56:32,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {1189#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1093#false} is VALID [2022-04-27 11:56:32,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {1185#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1189#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:32,987 INFO L272 TraceCheckUtils]: 28: Hoare triple {1181#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1185#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:32,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {1208#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} assume !(0 != ~y~0); {1181#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-27 11:56:32,989 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1170#(not (= |__VERIFIER_assert_#in~cond| 0))} {1092#true} #60#return; {1208#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 11:56:32,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {1170#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:56:32,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {1221#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1170#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:56:32,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {1092#true} ~cond := #in~cond; {1221#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:56:32,991 INFO L272 TraceCheckUtils]: 22: Hoare triple {1092#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1092#true} is VALID [2022-04-27 11:56:32,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {1092#true} assume !false; {1092#true} is VALID [2022-04-27 11:56:32,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {1092#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1092#true} is VALID [2022-04-27 11:56:32,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {1092#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1092#true} is VALID [2022-04-27 11:56:32,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {1092#true} assume !!(0 != ~y~0); {1092#true} is VALID [2022-04-27 11:56:32,991 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1092#true} {1092#true} #60#return; {1092#true} is VALID [2022-04-27 11:56:32,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {1092#true} assume true; {1092#true} is VALID [2022-04-27 11:56:32,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {1092#true} assume !(0 == ~cond); {1092#true} is VALID [2022-04-27 11:56:32,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {1092#true} ~cond := #in~cond; {1092#true} is VALID [2022-04-27 11:56:32,992 INFO L272 TraceCheckUtils]: 13: Hoare triple {1092#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1092#true} is VALID [2022-04-27 11:56:32,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {1092#true} assume !false; {1092#true} is VALID [2022-04-27 11:56:32,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {1092#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1092#true} is VALID [2022-04-27 11:56:32,993 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1092#true} {1092#true} #58#return; {1092#true} is VALID [2022-04-27 11:56:32,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {1092#true} assume true; {1092#true} is VALID [2022-04-27 11:56:32,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {1092#true} assume !(0 == ~cond); {1092#true} is VALID [2022-04-27 11:56:32,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {1092#true} ~cond := #in~cond; {1092#true} is VALID [2022-04-27 11:56:32,993 INFO L272 TraceCheckUtils]: 6: Hoare triple {1092#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1092#true} is VALID [2022-04-27 11:56:32,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {1092#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1092#true} is VALID [2022-04-27 11:56:32,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {1092#true} call #t~ret6 := main(); {1092#true} is VALID [2022-04-27 11:56:32,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1092#true} {1092#true} #64#return; {1092#true} is VALID [2022-04-27 11:56:32,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {1092#true} assume true; {1092#true} is VALID [2022-04-27 11:56:32,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {1092#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1092#true} is VALID [2022-04-27 11:56:32,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {1092#true} call ULTIMATE.init(); {1092#true} is VALID [2022-04-27 11:56:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:56:32,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:56:32,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635243064] [2022-04-27 11:56:32,995 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:56:32,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602148799] [2022-04-27 11:56:32,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602148799] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:56:32,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:56:32,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 11:56:32,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162950217] [2022-04-27 11:56:32,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:56:32,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2022-04-27 11:56:32,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:56:32,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 11:56:35,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 33 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:35,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:56:35,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:56:35,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:56:35,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:56:35,030 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 11:56:37,083 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:56:37,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:37,778 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-04-27 11:56:37,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:56:37,778 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2022-04-27 11:56:37,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:56:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 11:56:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-27 11:56:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 11:56:37,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-27 11:56:37,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2022-04-27 11:56:41,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 33 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 11:56:41,812 INFO L225 Difference]: With dead ends: 59 [2022-04-27 11:56:41,813 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 11:56:41,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:56:41,814 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:56:41,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 91 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 11:56:41,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 11:56:41,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-04-27 11:56:41,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:56:41,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 50 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:56:41,828 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 50 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:56:41,828 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 50 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:56:41,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:41,830 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 11:56:41,830 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 11:56:41,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:41,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:41,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-27 11:56:41,832 INFO L87 Difference]: Start difference. First operand has 50 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 52 states. [2022-04-27 11:56:41,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:56:41,834 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-27 11:56:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-27 11:56:41,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:56:41,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:56:41,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:56:41,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:56:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 11:56:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-04-27 11:56:41,836 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 32 [2022-04-27 11:56:41,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:56:41,837 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-04-27 11:56:41,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 11:56:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-27 11:56:41,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 11:56:41,838 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:56:41,838 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:56:41,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 11:56:42,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:42,039 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:56:42,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:56:42,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2061371941, now seen corresponding path program 1 times [2022-04-27 11:56:42,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:56:42,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393963897] [2022-04-27 11:56:42,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:42,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:56:42,053 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:56:42,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1118188246] [2022-04-27 11:56:42,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:56:42,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:56:42,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:56:42,055 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:56:42,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 11:56:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:42,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-27 11:56:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:56:42,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:56:51,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {1550#true} call ULTIMATE.init(); {1550#true} is VALID [2022-04-27 11:56:51,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1550#true} is VALID [2022-04-27 11:56:51,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-27 11:56:51,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#true} #64#return; {1550#true} is VALID [2022-04-27 11:56:51,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {1550#true} call #t~ret6 := main(); {1550#true} is VALID [2022-04-27 11:56:51,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {1550#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1550#true} is VALID [2022-04-27 11:56:51,350 INFO L272 TraceCheckUtils]: 6: Hoare triple {1550#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1550#true} is VALID [2022-04-27 11:56:51,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {1550#true} ~cond := #in~cond; {1550#true} is VALID [2022-04-27 11:56:51,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {1550#true} assume !(0 == ~cond); {1550#true} is VALID [2022-04-27 11:56:51,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-27 11:56:51,351 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1550#true} {1550#true} #58#return; {1550#true} is VALID [2022-04-27 11:56:51,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {1550#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1588#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 11:56:51,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {1588#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {1588#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 11:56:51,352 INFO L272 TraceCheckUtils]: 13: Hoare triple {1588#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1550#true} is VALID [2022-04-27 11:56:51,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {1550#true} ~cond := #in~cond; {1598#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:51,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {1598#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1602#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:56:51,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {1602#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1602#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:56:51,354 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1602#(not (= |__VERIFIER_assert_#in~cond| 0))} {1588#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #60#return; {1588#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 11:56:51,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {1588#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {1612#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-27 11:56:51,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {1612#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1616#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-27 11:56:51,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {1616#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1620#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 11:56:51,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {1620#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {1620#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 11:56:51,359 INFO L272 TraceCheckUtils]: 22: Hoare triple {1620#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1550#true} is VALID [2022-04-27 11:56:51,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {1550#true} ~cond := #in~cond; {1598#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:51,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {1598#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1602#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:56:51,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {1602#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1602#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:56:51,361 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1602#(not (= |__VERIFIER_assert_#in~cond| 0))} {1620#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #60#return; {1620#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 11:56:51,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {1620#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(0 != ~y~0); {1620#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 11:56:51,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {1620#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1645#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-27 11:56:51,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {1645#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1649#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} is VALID [2022-04-27 11:56:51,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {1649#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} assume !false; {1649#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} is VALID [2022-04-27 11:56:52,173 INFO L272 TraceCheckUtils]: 31: Hoare triple {1649#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:56:52,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {1656#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:56:52,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {1660#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1551#false} is VALID [2022-04-27 11:56:52,174 INFO L290 TraceCheckUtils]: 34: Hoare triple {1551#false} assume !false; {1551#false} is VALID [2022-04-27 11:56:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:56:52,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:59:23,342 INFO L290 TraceCheckUtils]: 34: Hoare triple {1551#false} assume !false; {1551#false} is VALID [2022-04-27 11:59:23,343 INFO L290 TraceCheckUtils]: 33: Hoare triple {1660#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1551#false} is VALID [2022-04-27 11:59:23,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {1656#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:59:23,344 INFO L272 TraceCheckUtils]: 31: Hoare triple {1676#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:59:23,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {1676#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {1676#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 11:59:23,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {1683#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1676#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-27 11:59:23,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {1687#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1683#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-27 11:59:23,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {1687#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {1687#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-27 11:59:23,360 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1602#(not (= |__VERIFIER_assert_#in~cond| 0))} {1694#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} #60#return; {1687#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-27 11:59:23,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {1602#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1602#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:59:23,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {1704#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1602#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:59:23,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {1550#true} ~cond := #in~cond; {1704#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:59:23,361 INFO L272 TraceCheckUtils]: 22: Hoare triple {1694#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1550#true} is VALID [2022-04-27 11:59:23,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {1694#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} assume !false; {1694#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 11:59:23,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {1714#(forall ((aux_div_v_main_~y~0_23_22 Int)) (or (and (or (not (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0))) (not (= (mod main_~y~0 2) 0)) (< (div main_~y~0 2) (* aux_div_v_main_~y~0_23_22 2)) (<= 0 (div main_~y~0 2)) (<= (+ 2 (* aux_div_v_main_~y~0_23_22 2)) (div main_~y~0 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))) (or (not (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (<= 0 (+ (div main_~y~0 2) 1)) (< (+ (div main_~y~0 2) 1) (* aux_div_v_main_~y~0_23_22 2)) (= (mod main_~y~0 2) 0) (<= (+ (* aux_div_v_main_~y~0_23_22 2) 1) (div main_~y~0 2)) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1)))) (= (+ (* (* aux_div_v_main_~y~0_23_22 main_~x~0) 4) main_~z~0 (* main_~x~0 4)) (* main_~b~0 main_~a~0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1694#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-27 11:59:23,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {1550#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1714#(forall ((aux_div_v_main_~y~0_23_22 Int)) (or (and (or (not (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0))) (not (= (mod main_~y~0 2) 0)) (< (div main_~y~0 2) (* aux_div_v_main_~y~0_23_22 2)) (<= 0 (div main_~y~0 2)) (<= (+ 2 (* aux_div_v_main_~y~0_23_22 2)) (div main_~y~0 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))) (or (not (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (<= 0 (+ (div main_~y~0 2) 1)) (< (+ (div main_~y~0 2) 1) (* aux_div_v_main_~y~0_23_22 2)) (= (mod main_~y~0 2) 0) (<= (+ (* aux_div_v_main_~y~0_23_22 2) 1) (div main_~y~0 2)) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1)))) (= (+ (* (* aux_div_v_main_~y~0_23_22 main_~x~0) 4) main_~z~0 (* main_~x~0 4)) (* main_~b~0 main_~a~0))))} is VALID [2022-04-27 11:59:23,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {1550#true} assume !!(0 != ~y~0); {1550#true} is VALID [2022-04-27 11:59:23,411 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1550#true} {1550#true} #60#return; {1550#true} is VALID [2022-04-27 11:59:23,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-27 11:59:23,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {1550#true} assume !(0 == ~cond); {1550#true} is VALID [2022-04-27 11:59:23,412 INFO L290 TraceCheckUtils]: 14: Hoare triple {1550#true} ~cond := #in~cond; {1550#true} is VALID [2022-04-27 11:59:23,412 INFO L272 TraceCheckUtils]: 13: Hoare triple {1550#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1550#true} is VALID [2022-04-27 11:59:23,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {1550#true} assume !false; {1550#true} is VALID [2022-04-27 11:59:23,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {1550#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1550#true} is VALID [2022-04-27 11:59:23,412 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1550#true} {1550#true} #58#return; {1550#true} is VALID [2022-04-27 11:59:23,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-27 11:59:23,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {1550#true} assume !(0 == ~cond); {1550#true} is VALID [2022-04-27 11:59:23,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {1550#true} ~cond := #in~cond; {1550#true} is VALID [2022-04-27 11:59:23,412 INFO L272 TraceCheckUtils]: 6: Hoare triple {1550#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1550#true} is VALID [2022-04-27 11:59:23,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {1550#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1550#true} is VALID [2022-04-27 11:59:23,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {1550#true} call #t~ret6 := main(); {1550#true} is VALID [2022-04-27 11:59:23,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#true} #64#return; {1550#true} is VALID [2022-04-27 11:59:23,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} assume true; {1550#true} is VALID [2022-04-27 11:59:23,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1550#true} is VALID [2022-04-27 11:59:23,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {1550#true} call ULTIMATE.init(); {1550#true} is VALID [2022-04-27 11:59:23,413 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 11:59:23,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:59:23,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393963897] [2022-04-27 11:59:23,414 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:59:23,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118188246] [2022-04-27 11:59:23,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118188246] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:59:23,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:59:23,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-04-27 11:59:23,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070727846] [2022-04-27 11:59:23,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:59:23,415 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 35 [2022-04-27 11:59:23,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:59:23,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 11:59:23,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:59:23,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 11:59:23,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:59:23,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 11:59:23,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=244, Unknown=2, NotChecked=0, Total=306 [2022-04-27 11:59:23,666 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-27 11:59:29,404 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:59:34,477 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:59:42,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 11:59:42,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=100, Invalid=404, Unknown=2, NotChecked=0, Total=506 [2022-04-27 11:59:42,012 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:59:42,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 134 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 159 Invalid, 1 Unknown, 21 Unchecked, 4.5s Time] [2022-04-27 11:59:42,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 11:59:42,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:59:42,216 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: explication result by transitivity: VALID old explication result: INVALID at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:941) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-27 11:59:42,220 INFO L158 Benchmark]: Toolchain (without parser) took 256068.51ms. Allocated memory was 183.5MB in the beginning and 230.7MB in the end (delta: 47.2MB). Free memory was 124.2MB in the beginning and 111.0MB in the end (delta: 13.2MB). Peak memory consumption was 61.2MB. Max. memory is 8.0GB. [2022-04-27 11:59:42,220 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 183.5MB. Free memory was 141.1MB in the beginning and 141.1MB in the end (delta: 76.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:59:42,221 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.72ms. Allocated memory was 183.5MB in the beginning and 230.7MB in the end (delta: 47.2MB). Free memory was 124.1MB in the beginning and 199.7MB in the end (delta: -75.6MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2022-04-27 11:59:42,221 INFO L158 Benchmark]: Boogie Preprocessor took 28.55ms. Allocated memory is still 230.7MB. Free memory was 199.7MB in the beginning and 198.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 11:59:42,223 INFO L158 Benchmark]: RCFGBuilder took 327.95ms. Allocated memory is still 230.7MB. Free memory was 198.1MB in the beginning and 186.1MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 11:59:42,223 INFO L158 Benchmark]: TraceAbstraction took 255466.79ms. Allocated memory is still 230.7MB. Free memory was 185.6MB in the beginning and 111.0MB in the end (delta: 74.5MB). Peak memory consumption was 75.3MB. Max. memory is 8.0GB. [2022-04-27 11:59:42,224 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 183.5MB. Free memory was 141.1MB in the beginning and 141.1MB in the end (delta: 76.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.72ms. Allocated memory was 183.5MB in the beginning and 230.7MB in the end (delta: 47.2MB). Free memory was 124.1MB in the beginning and 199.7MB in the end (delta: -75.6MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.55ms. Allocated memory is still 230.7MB. Free memory was 199.7MB in the beginning and 198.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 327.95ms. Allocated memory is still 230.7MB. Free memory was 198.1MB in the beginning and 186.1MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 255466.79ms. Allocated memory is still 230.7MB. Free memory was 185.6MB in the beginning and 111.0MB in the end (delta: 74.5MB). Peak memory consumption was 75.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: explication result by transitivity: VALID old explication result: INVALID de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: explication result by transitivity: VALID old explication result: INVALID: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:941) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-27 11:59:42,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...