/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench/cohendiv-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:18:28,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:18:28,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:18:28,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:18:28,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:18:28,982 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:18:28,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:18:28,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:18:28,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:18:28,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:18:28,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:18:28,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:18:28,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:18:28,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:18:28,998 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:18:29,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:18:29,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:18:29,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:18:29,003 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:18:29,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:18:29,010 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:18:29,011 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:18:29,012 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:18:29,013 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:18:29,014 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:18:29,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:18:29,017 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:18:29,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:18:29,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:18:29,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:18:29,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:18:29,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:18:29,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:18:29,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:18:29,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:18:29,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:18:29,022 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:18:29,023 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:18:29,023 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:18:29,023 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:18:29,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:18:29,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:18:29,026 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:18:29,036 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:18:29,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:18:29,037 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:18:29,037 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:18:29,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:18:29,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:18:29,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:18:29,038 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:18:29,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:18:29,038 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:18:29,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:18:29,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:18:29,039 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:18:29,039 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:18:29,039 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:18:29,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:18:29,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:18:29,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:18:29,040 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:18:29,040 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:18:29,040 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:18:29,040 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:18:29,040 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-15 13:18:29,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:18:29,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:18:29,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:18:29,285 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:18:29,286 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:18:29,287 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/cohendiv-ll.c [2022-04-15 13:18:29,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5dde1669/945c5c035ae0475abf8ea2ca526f26ee/FLAG96912d5a4 [2022-04-15 13:18:29,704 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:18:29,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/cohendiv-ll.c [2022-04-15 13:18:29,710 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5dde1669/945c5c035ae0475abf8ea2ca526f26ee/FLAG96912d5a4 [2022-04-15 13:18:30,114 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5dde1669/945c5c035ae0475abf8ea2ca526f26ee [2022-04-15 13:18:30,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:18:30,118 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:18:30,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:18:30,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:18:30,123 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:18:30,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:18:30" (1/1) ... [2022-04-15 13:18:30,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63fd4a3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:30, skipping insertion in model container [2022-04-15 13:18:30,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:18:30" (1/1) ... [2022-04-15 13:18:30,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:18:30,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:18:30,282 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/cohendiv-ll.c[576,589] [2022-04-15 13:18:30,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:18:30,309 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:18:30,318 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/cohendiv-ll.c[576,589] [2022-04-15 13:18:30,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:18:30,334 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:18:30,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:30 WrapperNode [2022-04-15 13:18:30,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:18:30,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:18:30,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:18:30,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:18:30,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:30" (1/1) ... [2022-04-15 13:18:30,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:30" (1/1) ... [2022-04-15 13:18:30,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:30" (1/1) ... [2022-04-15 13:18:30,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:30" (1/1) ... [2022-04-15 13:18:30,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:30" (1/1) ... [2022-04-15 13:18:30,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:30" (1/1) ... [2022-04-15 13:18:30,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:30" (1/1) ... [2022-04-15 13:18:30,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:18:30,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:18:30,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:18:30,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:18:30,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:30" (1/1) ... [2022-04-15 13:18:30,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:18:30,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:30,404 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-15 13:18:30,408 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-15 13:18:30,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:18:30,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:18:30,433 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:18:30,434 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:18:30,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:18:30,434 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:18:30,435 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:18:30,435 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:18:30,435 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:18:30,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:18:30,435 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 13:18:30,435 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:18:30,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:18:30,436 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:18:30,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:18:30,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:18:30,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:18:30,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:18:30,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:18:30,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:18:30,495 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:18:30,496 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:18:30,663 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:18:30,670 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:18:30,670 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 13:18:30,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:18:30 BoogieIcfgContainer [2022-04-15 13:18:30,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:18:30,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:18:30,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:18:30,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:18:30,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:18:30" (1/3) ... [2022-04-15 13:18:30,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60aa5a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:18:30, skipping insertion in model container [2022-04-15 13:18:30,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:18:30" (2/3) ... [2022-04-15 13:18:30,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60aa5a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:18:30, skipping insertion in model container [2022-04-15 13:18:30,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:18:30" (3/3) ... [2022-04-15 13:18:30,678 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll.c [2022-04-15 13:18:30,682 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:18:30,682 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:18:30,741 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:18:30,748 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-15 13:18:30,748 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:18:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 13:18:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 13:18:30,780 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:30,781 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:18:30,781 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:30,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:30,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1389800432, now seen corresponding path program 1 times [2022-04-15 13:18:30,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:30,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [856956267] [2022-04-15 13:18:30,806 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:18:30,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1389800432, now seen corresponding path program 2 times [2022-04-15 13:18:30,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:30,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182493731] [2022-04-15 13:18:30,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:30,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:30,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:18:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:31,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(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(14, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-15 13:18:31,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-15 13:18:31,016 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2022-04-15 13:18:31,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:18:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:31,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-15 13:18:31,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-15 13:18:31,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-15 13:18:31,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #75#return; {40#false} is VALID [2022-04-15 13:18:31,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:18:31,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(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(14, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-15 13:18:31,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-15 13:18:31,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2022-04-15 13:18:31,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret6 := main(); {39#true} is VALID [2022-04-15 13:18:31,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {39#true} is VALID [2022-04-15 13:18:31,047 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {39#true} is VALID [2022-04-15 13:18:31,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-15 13:18:31,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-15 13:18:31,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-15 13:18:31,052 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #75#return; {40#false} is VALID [2022-04-15 13:18:31,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {40#false} is VALID [2022-04-15 13:18:31,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume false; {40#false} is VALID [2022-04-15 13:18:31,052 INFO L272 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {40#false} is VALID [2022-04-15 13:18:31,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-15 13:18:31,053 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-15 13:18:31,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-15 13:18:31,053 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-15 13:18:31,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:31,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182493731] [2022-04-15 13:18:31,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182493731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:31,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:31,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:18:31,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:31,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [856956267] [2022-04-15 13:18:31,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [856956267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:31,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:31,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:18:31,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343957832] [2022-04-15 13:18:31,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:31,062 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-15 13:18:31,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:31,066 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-15 13:18:31,100 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-15 13:18:31,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:18:31,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:31,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:18:31,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:18:31,121 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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-15 13:18:31,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:31,320 INFO L93 Difference]: Finished difference Result 63 states and 95 transitions. [2022-04-15 13:18:31,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:18:31,321 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-15 13:18:31,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:31,322 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-15 13:18:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-15 13:18:31,336 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-15 13:18:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-15 13:18:31,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-15 13:18:31,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:31,468 INFO L225 Difference]: With dead ends: 63 [2022-04-15 13:18:31,468 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 13:18:31,470 INFO L912 BasicCegarLoop]: 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-15 13:18:31,473 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:31,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:18:31,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 13:18:31,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 13:18:31,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:31,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 13:18:31,502 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 13:18:31,503 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 13:18:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:31,507 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-15 13:18:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-15 13:18:31,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:31,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:31,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 31 states. [2022-04-15 13:18:31,510 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 31 states. [2022-04-15 13:18:31,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:31,513 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-15 13:18:31,513 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-15 13:18:31,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:31,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:31,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:31,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:31,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 13:18:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-04-15 13:18:31,519 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 17 [2022-04-15 13:18:31,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:31,519 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-04-15 13:18:31,520 INFO L479 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-15 13:18:31,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 38 transitions. [2022-04-15 13:18:31,568 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-15 13:18:31,568 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-15 13:18:31,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 13:18:31,569 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:31,569 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:18:31,569 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:18:31,569 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:31,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:31,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2071348352, now seen corresponding path program 1 times [2022-04-15 13:18:31,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:31,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [700928522] [2022-04-15 13:18:31,579 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:18:31,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2071348352, now seen corresponding path program 2 times [2022-04-15 13:18:31,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:31,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461346984] [2022-04-15 13:18:31,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:31,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:31,612 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:18:31,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [6088976] [2022-04-15 13:18:31,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:18:31,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:31,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:31,623 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-15 13:18:31,647 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-15 13:18:31,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 13:18:31,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:18:31,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:18:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:31,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:18:31,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {301#true} is VALID [2022-04-15 13:18:31,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#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(14, 2);call #Ultimate.allocInit(12, 3); {301#true} is VALID [2022-04-15 13:18:31,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 13:18:31,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #91#return; {301#true} is VALID [2022-04-15 13:18:31,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret6 := main(); {301#true} is VALID [2022-04-15 13:18:31,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {301#true} is VALID [2022-04-15 13:18:31,884 INFO L272 TraceCheckUtils]: 6: Hoare triple {301#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {301#true} is VALID [2022-04-15 13:18:31,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-15 13:18:31,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-15 13:18:31,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 13:18:31,885 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {301#true} {301#true} #75#return; {301#true} is VALID [2022-04-15 13:18:31,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {339#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 13:18:31,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {339#(and (= main_~a~0 0) (= main_~b~0 0))} assume !false; {339#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 13:18:31,888 INFO L272 TraceCheckUtils]: 13: Hoare triple {339#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {346#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:18:31,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {346#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {350#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:18:31,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {350#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {302#false} is VALID [2022-04-15 13:18:31,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-15 13:18:31,889 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-15 13:18:31,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:18:31,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:31,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461346984] [2022-04-15 13:18:31,890 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:18:31,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6088976] [2022-04-15 13:18:31,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6088976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:31,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:31,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:18:31,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:31,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [700928522] [2022-04-15 13:18:31,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [700928522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:31,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:31,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:18:31,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784989018] [2022-04-15 13:18:31,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:31,895 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-15 13:18:31,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:31,895 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-15 13:18:31,910 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-15 13:18:31,910 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:18:31,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:31,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:18:31,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:18:31,912 INFO L87 Difference]: Start difference. First operand 31 states and 38 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-15 13:18:32,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:32,104 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-15 13:18:32,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:18:32,105 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-15 13:18:32,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:32,105 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-15 13:18:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-15 13:18:32,107 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-15 13:18:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-15 13:18:32,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-15 13:18:32,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:32,167 INFO L225 Difference]: With dead ends: 42 [2022-04-15 13:18:32,167 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 13:18:32,167 INFO L912 BasicCegarLoop]: 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-15 13:18:32,168 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:32,169 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:18:32,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 13:18:32,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-15 13:18:32,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:32,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 13:18:32,182 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 13:18:32,182 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 13:18:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:32,186 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-15 13:18:32,186 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-15 13:18:32,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:32,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:32,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 40 states. [2022-04-15 13:18:32,193 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 40 states. [2022-04-15 13:18:32,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:32,200 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-15 13:18:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-15 13:18:32,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:32,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:32,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:32,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 13:18:32,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-04-15 13:18:32,207 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 17 [2022-04-15 13:18:32,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:32,208 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-04-15 13:18:32,208 INFO L479 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-15 13:18:32,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 44 transitions. [2022-04-15 13:18:32,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:32,260 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-15 13:18:32,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 13:18:32,262 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:32,262 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:18:32,291 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-15 13:18:32,475 WARN L460 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-15 13:18:32,476 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:32,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:32,476 INFO L85 PathProgramCache]: Analyzing trace with hash 933849696, now seen corresponding path program 1 times [2022-04-15 13:18:32,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:32,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1233363997] [2022-04-15 13:18:32,477 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:18:32,477 INFO L85 PathProgramCache]: Analyzing trace with hash 933849696, now seen corresponding path program 2 times [2022-04-15 13:18:32,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:32,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656498805] [2022-04-15 13:18:32,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:32,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:32,491 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:18:32,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [952032283] [2022-04-15 13:18:32,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:18:32,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:32,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:32,497 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-15 13:18:32,498 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-15 13:18:32,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:18:32,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:18:32,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:18:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:32,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:18:32,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {596#true} call ULTIMATE.init(); {596#true} is VALID [2022-04-15 13:18:32,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#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(14, 2);call #Ultimate.allocInit(12, 3); {596#true} is VALID [2022-04-15 13:18:32,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-15 13:18:32,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {596#true} {596#true} #91#return; {596#true} is VALID [2022-04-15 13:18:32,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {596#true} call #t~ret6 := main(); {596#true} is VALID [2022-04-15 13:18:32,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {596#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {596#true} is VALID [2022-04-15 13:18:32,662 INFO L272 TraceCheckUtils]: 6: Hoare triple {596#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {596#true} is VALID [2022-04-15 13:18:32,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-15 13:18:32,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-15 13:18:32,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-15 13:18:32,663 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {596#true} {596#true} #75#return; {596#true} is VALID [2022-04-15 13:18:32,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {596#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:18:32,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !false; {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:18:32,664 INFO L272 TraceCheckUtils]: 13: Hoare triple {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {596#true} is VALID [2022-04-15 13:18:32,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#true} ~cond := #in~cond; {596#true} is VALID [2022-04-15 13:18:32,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {596#true} assume !(0 == ~cond); {596#true} is VALID [2022-04-15 13:18:32,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {596#true} assume true; {596#true} is VALID [2022-04-15 13:18:32,666 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {596#true} {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #77#return; {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:18:32,667 INFO L272 TraceCheckUtils]: 18: Hoare triple {634#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:18:32,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {656#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:18:32,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {660#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {597#false} is VALID [2022-04-15 13:18:32,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {597#false} assume !false; {597#false} is VALID [2022-04-15 13:18:32,668 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-15 13:18:32,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:18:32,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:32,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656498805] [2022-04-15 13:18:32,668 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:18:32,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952032283] [2022-04-15 13:18:32,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952032283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:32,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:32,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:18:32,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:32,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1233363997] [2022-04-15 13:18:32,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1233363997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:32,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:32,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:18:32,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285778525] [2022-04-15 13:18:32,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:32,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 13:18:32,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:32,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:18:32,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:32,689 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:18:32,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:32,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:18:32,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:18:32,690 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:18:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:32,888 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2022-04-15 13:18:32,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:18:32,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 13:18:32,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:18:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 13:18:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:18:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 13:18:32,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-15 13:18:32,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:32,956 INFO L225 Difference]: With dead ends: 54 [2022-04-15 13:18:32,956 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 13:18:32,957 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-15 13:18:32,958 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 11 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:32,958 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 123 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:18:32,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 13:18:32,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-15 13:18:32,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:32,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 13:18:32,975 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 13:18:32,976 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 13:18:32,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:32,980 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-15 13:18:32,980 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-15 13:18:32,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:32,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:32,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 51 states. [2022-04-15 13:18:32,981 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 51 states. [2022-04-15 13:18:32,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:32,984 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-04-15 13:18:32,984 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-15 13:18:32,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:32,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:32,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:32,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:32,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 13:18:32,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-15 13:18:32,987 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 22 [2022-04-15 13:18:32,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:32,988 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-15 13:18:32,988 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:18:32,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-15 13:18:33,061 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-15 13:18:33,062 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-15 13:18:33,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 13:18:33,062 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:33,063 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:18:33,087 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-15 13:18:33,275 WARN L460 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-15 13:18:33,275 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:33,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:33,276 INFO L85 PathProgramCache]: Analyzing trace with hash 721086345, now seen corresponding path program 1 times [2022-04-15 13:18:33,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:33,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [507669185] [2022-04-15 13:18:33,277 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:18:33,277 INFO L85 PathProgramCache]: Analyzing trace with hash 721086345, now seen corresponding path program 2 times [2022-04-15 13:18:33,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:33,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539966378] [2022-04-15 13:18:33,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:33,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:33,293 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:18:33,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2031609123] [2022-04-15 13:18:33,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:18:33,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:33,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:33,297 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-15 13:18:33,306 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-15 13:18:33,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:18:33,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:18:33,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:18:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:33,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:18:33,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {978#true} call ULTIMATE.init(); {978#true} is VALID [2022-04-15 13:18:33,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {978#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(14, 2);call #Ultimate.allocInit(12, 3); {978#true} is VALID [2022-04-15 13:18:33,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-15 13:18:33,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {978#true} {978#true} #91#return; {978#true} is VALID [2022-04-15 13:18:33,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {978#true} call #t~ret6 := main(); {978#true} is VALID [2022-04-15 13:18:33,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {978#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {978#true} is VALID [2022-04-15 13:18:33,473 INFO L272 TraceCheckUtils]: 6: Hoare triple {978#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {978#true} is VALID [2022-04-15 13:18:33,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {978#true} ~cond := #in~cond; {978#true} is VALID [2022-04-15 13:18:33,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {978#true} assume !(0 == ~cond); {978#true} is VALID [2022-04-15 13:18:33,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-15 13:18:33,476 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {978#true} {978#true} #75#return; {978#true} is VALID [2022-04-15 13:18:33,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {978#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {978#true} is VALID [2022-04-15 13:18:33,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {978#true} assume !false; {978#true} is VALID [2022-04-15 13:18:33,490 INFO L272 TraceCheckUtils]: 13: Hoare triple {978#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {978#true} is VALID [2022-04-15 13:18:33,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {978#true} ~cond := #in~cond; {978#true} is VALID [2022-04-15 13:18:33,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {978#true} assume !(0 == ~cond); {978#true} is VALID [2022-04-15 13:18:33,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-15 13:18:33,490 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {978#true} {978#true} #77#return; {978#true} is VALID [2022-04-15 13:18:33,490 INFO L272 TraceCheckUtils]: 18: Hoare triple {978#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {978#true} is VALID [2022-04-15 13:18:33,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {978#true} ~cond := #in~cond; {978#true} is VALID [2022-04-15 13:18:33,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {978#true} assume !(0 == ~cond); {978#true} is VALID [2022-04-15 13:18:33,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {978#true} assume true; {978#true} is VALID [2022-04-15 13:18:33,491 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {978#true} {978#true} #79#return; {978#true} is VALID [2022-04-15 13:18:33,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {978#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1052#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 13:18:33,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {1052#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} assume !false; {1052#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 13:18:33,495 INFO L272 TraceCheckUtils]: 25: Hoare triple {1052#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1059#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:18:33,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {1059#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1063#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:18:33,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {1063#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {979#false} is VALID [2022-04-15 13:18:33,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {979#false} assume !false; {979#false} is VALID [2022-04-15 13:18:33,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 13:18:33,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:18:33,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:33,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539966378] [2022-04-15 13:18:33,497 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:18:33,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031609123] [2022-04-15 13:18:33,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031609123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:33,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:33,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:18:33,497 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:33,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [507669185] [2022-04-15 13:18:33,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [507669185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:33,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:33,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:18:33,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718734283] [2022-04-15 13:18:33,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:33,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-15 13:18:33,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:33,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 13:18:33,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:33,519 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:18:33,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:33,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:18:33,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:18:33,520 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 13:18:33,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:33,761 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2022-04-15 13:18:33,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:18:33,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-15 13:18:33,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 13:18:33,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 13:18:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 13:18:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-15 13:18:33,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-15 13:18:33,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:33,824 INFO L225 Difference]: With dead ends: 76 [2022-04-15 13:18:33,824 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 13:18:33,824 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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-15 13:18:33,825 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:33,826 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 126 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:18:33,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 13:18:33,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2022-04-15 13:18:33,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:33,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 13:18:33,850 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 13:18:33,851 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 13:18:33,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:33,857 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-04-15 13:18:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-04-15 13:18:33,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:33,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:33,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 74 states. [2022-04-15 13:18:33,859 INFO L87 Difference]: Start difference. First operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 74 states. [2022-04-15 13:18:33,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:33,865 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-04-15 13:18:33,865 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-04-15 13:18:33,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:33,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:33,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:33,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 13:18:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2022-04-15 13:18:33,872 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 29 [2022-04-15 13:18:33,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:33,872 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2022-04-15 13:18:33,873 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 13:18:33,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 87 transitions. [2022-04-15 13:18:33,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:33,969 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2022-04-15 13:18:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 13:18:33,970 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:33,970 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:18:33,986 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-15 13:18:34,171 WARN L460 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-15 13:18:34,171 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:34,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:34,172 INFO L85 PathProgramCache]: Analyzing trace with hash -607067127, now seen corresponding path program 1 times [2022-04-15 13:18:34,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:34,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [106150577] [2022-04-15 13:18:34,172 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:18:34,173 INFO L85 PathProgramCache]: Analyzing trace with hash -607067127, now seen corresponding path program 2 times [2022-04-15 13:18:34,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:34,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889856217] [2022-04-15 13:18:34,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:34,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:34,187 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:18:34,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [543420098] [2022-04-15 13:18:34,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:18:34,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:34,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:34,189 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-15 13:18:34,203 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-15 13:18:34,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:18:34,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:18:34,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 13:18:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:34,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:18:34,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {1505#true} call ULTIMATE.init(); {1505#true} is VALID [2022-04-15 13:18:34,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {1505#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(14, 2);call #Ultimate.allocInit(12, 3); {1505#true} is VALID [2022-04-15 13:18:34,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-15 13:18:34,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1505#true} {1505#true} #91#return; {1505#true} is VALID [2022-04-15 13:18:34,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {1505#true} call #t~ret6 := main(); {1505#true} is VALID [2022-04-15 13:18:34,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {1505#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1505#true} is VALID [2022-04-15 13:18:34,413 INFO L272 TraceCheckUtils]: 6: Hoare triple {1505#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1505#true} is VALID [2022-04-15 13:18:34,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {1505#true} ~cond := #in~cond; {1531#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 13:18:34,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {1531#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1535#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 13:18:34,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {1535#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1535#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 13:18:34,415 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1535#(not (= |assume_abort_if_not_#in~cond| 0))} {1505#true} #75#return; {1542#(<= 1 main_~y~0)} is VALID [2022-04-15 13:18:34,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {1542#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1542#(<= 1 main_~y~0)} is VALID [2022-04-15 13:18:34,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {1542#(<= 1 main_~y~0)} assume !false; {1542#(<= 1 main_~y~0)} is VALID [2022-04-15 13:18:34,419 INFO L272 TraceCheckUtils]: 13: Hoare triple {1542#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1505#true} is VALID [2022-04-15 13:18:34,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-15 13:18:34,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-15 13:18:34,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-15 13:18:34,420 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1505#true} {1542#(<= 1 main_~y~0)} #77#return; {1542#(<= 1 main_~y~0)} is VALID [2022-04-15 13:18:34,420 INFO L272 TraceCheckUtils]: 18: Hoare triple {1542#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1505#true} is VALID [2022-04-15 13:18:34,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-15 13:18:34,420 INFO L290 TraceCheckUtils]: 20: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-15 13:18:34,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-15 13:18:34,421 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1505#true} {1542#(<= 1 main_~y~0)} #79#return; {1542#(<= 1 main_~y~0)} is VALID [2022-04-15 13:18:34,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {1542#(<= 1 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1582#(<= 1 main_~r~0)} is VALID [2022-04-15 13:18:34,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {1582#(<= 1 main_~r~0)} assume !false; {1582#(<= 1 main_~r~0)} is VALID [2022-04-15 13:18:34,423 INFO L272 TraceCheckUtils]: 25: Hoare triple {1582#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1505#true} is VALID [2022-04-15 13:18:34,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-15 13:18:34,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-15 13:18:34,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-15 13:18:34,425 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1505#true} {1582#(<= 1 main_~r~0)} #81#return; {1582#(<= 1 main_~r~0)} is VALID [2022-04-15 13:18:34,426 INFO L272 TraceCheckUtils]: 30: Hoare triple {1582#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1505#true} is VALID [2022-04-15 13:18:34,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {1505#true} ~cond := #in~cond; {1505#true} is VALID [2022-04-15 13:18:34,426 INFO L290 TraceCheckUtils]: 32: Hoare triple {1505#true} assume !(0 == ~cond); {1505#true} is VALID [2022-04-15 13:18:34,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {1505#true} assume true; {1505#true} is VALID [2022-04-15 13:18:34,435 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1505#true} {1582#(<= 1 main_~r~0)} #83#return; {1582#(<= 1 main_~r~0)} is VALID [2022-04-15 13:18:34,436 INFO L272 TraceCheckUtils]: 35: Hoare triple {1582#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {1619#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:18:34,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {1619#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1623#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:18:34,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {1623#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1506#false} is VALID [2022-04-15 13:18:34,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {1506#false} assume !false; {1506#false} is VALID [2022-04-15 13:18:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 13:18:34,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:18:34,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:34,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889856217] [2022-04-15 13:18:34,438 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:18:34,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543420098] [2022-04-15 13:18:34,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543420098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:34,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:34,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:18:34,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:34,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [106150577] [2022-04-15 13:18:34,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [106150577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:34,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:34,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:18:34,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772609011] [2022-04-15 13:18:34,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:34,440 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-15 13:18:34,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:34,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 13:18:34,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:34,465 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:18:34,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:34,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:18:34,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:18:34,466 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 13:18:34,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:34,819 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-15 13:18:34,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:18:34,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2022-04-15 13:18:34,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:34,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 13:18:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 13:18:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 13:18:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 13:18:34,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-15 13:18:34,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:34,860 INFO L225 Difference]: With dead ends: 73 [2022-04-15 13:18:34,860 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 13:18:34,861 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:18:34,861 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:34,862 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 145 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:18:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 13:18:34,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-15 13:18:34,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:34,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 13:18:34,923 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 13:18:34,923 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 13:18:34,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:34,926 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-15 13:18:34,926 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-15 13:18:34,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:34,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:34,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 71 states. [2022-04-15 13:18:34,927 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 71 states. [2022-04-15 13:18:34,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:34,930 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-15 13:18:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-15 13:18:34,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:34,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:34,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:34,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:34,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 13:18:34,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-04-15 13:18:34,944 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 39 [2022-04-15 13:18:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:34,945 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-04-15 13:18:34,945 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 13:18:34,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 90 transitions. [2022-04-15 13:18:35,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:35,042 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-15 13:18:35,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 13:18:35,043 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:35,043 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:18:35,075 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-15 13:18:35,255 WARN L460 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-15 13:18:35,255 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:35,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:35,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1279335692, now seen corresponding path program 1 times [2022-04-15 13:18:35,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:35,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1369177914] [2022-04-15 13:18:35,256 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:18:35,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1279335692, now seen corresponding path program 2 times [2022-04-15 13:18:35,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:35,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931090106] [2022-04-15 13:18:35,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:35,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:35,273 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:18:35,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409341425] [2022-04-15 13:18:35,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:18:35,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:35,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:35,280 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-15 13:18:35,280 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-15 13:18:35,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:18:35,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:18:35,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 13:18:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:35,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:18:35,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2065#true} is VALID [2022-04-15 13:18:35,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#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(14, 2);call #Ultimate.allocInit(12, 3); {2065#true} is VALID [2022-04-15 13:18:35,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 13:18:35,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #91#return; {2065#true} is VALID [2022-04-15 13:18:35,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret6 := main(); {2065#true} is VALID [2022-04-15 13:18:35,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2065#true} is VALID [2022-04-15 13:18:35,678 INFO L272 TraceCheckUtils]: 6: Hoare triple {2065#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2065#true} is VALID [2022-04-15 13:18:35,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 13:18:35,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 13:18:35,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 13:18:35,679 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2065#true} {2065#true} #75#return; {2065#true} is VALID [2022-04-15 13:18:35,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {2065#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2065#true} is VALID [2022-04-15 13:18:35,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {2065#true} assume !false; {2065#true} is VALID [2022-04-15 13:18:35,679 INFO L272 TraceCheckUtils]: 13: Hoare triple {2065#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 13:18:35,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 13:18:35,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 13:18:35,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 13:18:35,680 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2065#true} {2065#true} #77#return; {2065#true} is VALID [2022-04-15 13:18:35,680 INFO L272 TraceCheckUtils]: 18: Hoare triple {2065#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 13:18:35,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 13:18:35,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 13:18:35,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 13:18:35,681 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2065#true} {2065#true} #79#return; {2065#true} is VALID [2022-04-15 13:18:35,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {2065#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2065#true} is VALID [2022-04-15 13:18:35,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {2065#true} assume !false; {2065#true} is VALID [2022-04-15 13:18:35,681 INFO L272 TraceCheckUtils]: 25: Hoare triple {2065#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 13:18:35,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {2065#true} ~cond := #in~cond; {2148#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:18:35,682 INFO L290 TraceCheckUtils]: 27: Hoare triple {2148#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:18:35,683 INFO L290 TraceCheckUtils]: 28: Hoare triple {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:18:35,684 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} {2065#true} #81#return; {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 13:18:35,684 INFO L272 TraceCheckUtils]: 30: Hoare triple {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 13:18:35,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 13:18:35,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 13:18:35,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 13:18:35,685 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2065#true} {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} #83#return; {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 13:18:35,685 INFO L272 TraceCheckUtils]: 35: Hoare triple {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2065#true} is VALID [2022-04-15 13:18:35,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 13:18:35,685 INFO L290 TraceCheckUtils]: 37: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 13:18:35,685 INFO L290 TraceCheckUtils]: 38: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 13:18:35,686 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2065#true} {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} #85#return; {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 13:18:35,687 INFO L290 TraceCheckUtils]: 40: Hoare triple {2159#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {2193#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-15 13:18:35,688 INFO L272 TraceCheckUtils]: 41: Hoare triple {2193#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {2197#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:18:35,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {2197#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2201#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:18:35,689 INFO L290 TraceCheckUtils]: 43: Hoare triple {2201#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2066#false} is VALID [2022-04-15 13:18:35,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-15 13:18:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 13:18:35,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:18:40,224 INFO L290 TraceCheckUtils]: 44: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-15 13:18:40,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {2201#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2066#false} is VALID [2022-04-15 13:18:40,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {2197#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2201#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:18:40,226 INFO L272 TraceCheckUtils]: 41: Hoare triple {2193#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {2197#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:18:40,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} assume !!(~r~0 >= 2 * ~b~0); {2193#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-15 13:18:40,228 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2065#true} {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #85#return; {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-15 13:18:40,228 INFO L290 TraceCheckUtils]: 38: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 13:18:40,228 INFO L290 TraceCheckUtils]: 37: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 13:18:40,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 13:18:40,229 INFO L272 TraceCheckUtils]: 35: Hoare triple {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2065#true} is VALID [2022-04-15 13:18:40,230 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2065#true} {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #83#return; {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-15 13:18:40,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 13:18:40,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 13:18:40,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 13:18:40,234 INFO L272 TraceCheckUtils]: 30: Hoare triple {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 13:18:40,235 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} {2065#true} #81#return; {2220#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-15 13:18:40,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:18:40,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {2263#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2152#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:18:40,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {2065#true} ~cond := #in~cond; {2263#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:18:40,237 INFO L272 TraceCheckUtils]: 25: Hoare triple {2065#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 13:18:40,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {2065#true} assume !false; {2065#true} is VALID [2022-04-15 13:18:40,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {2065#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2065#true} is VALID [2022-04-15 13:18:40,241 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2065#true} {2065#true} #79#return; {2065#true} is VALID [2022-04-15 13:18:40,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 13:18:40,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 13:18:40,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 13:18:40,243 INFO L272 TraceCheckUtils]: 18: Hoare triple {2065#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 13:18:40,243 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2065#true} {2065#true} #77#return; {2065#true} is VALID [2022-04-15 13:18:40,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 13:18:40,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 13:18:40,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 13:18:40,244 INFO L272 TraceCheckUtils]: 13: Hoare triple {2065#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2065#true} is VALID [2022-04-15 13:18:40,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {2065#true} assume !false; {2065#true} is VALID [2022-04-15 13:18:40,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {2065#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2065#true} is VALID [2022-04-15 13:18:40,244 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2065#true} {2065#true} #75#return; {2065#true} is VALID [2022-04-15 13:18:40,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 13:18:40,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {2065#true} assume !(0 == ~cond); {2065#true} is VALID [2022-04-15 13:18:40,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {2065#true} ~cond := #in~cond; {2065#true} is VALID [2022-04-15 13:18:40,245 INFO L272 TraceCheckUtils]: 6: Hoare triple {2065#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2065#true} is VALID [2022-04-15 13:18:40,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2065#true} is VALID [2022-04-15 13:18:40,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret6 := main(); {2065#true} is VALID [2022-04-15 13:18:40,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #91#return; {2065#true} is VALID [2022-04-15 13:18:40,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-15 13:18:40,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#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(14, 2);call #Ultimate.allocInit(12, 3); {2065#true} is VALID [2022-04-15 13:18:40,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2065#true} is VALID [2022-04-15 13:18:40,246 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 13:18:40,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:40,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931090106] [2022-04-15 13:18:40,246 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:18:40,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409341425] [2022-04-15 13:18:40,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409341425] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:18:40,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 13:18:40,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 13:18:40,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:40,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1369177914] [2022-04-15 13:18:40,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1369177914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:40,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:40,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:18:40,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798160639] [2022-04-15 13:18:40,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:40,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2022-04-15 13:18:40,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:40,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 13:18:40,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:40,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:18:40,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:40,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:18:40,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:18:40,280 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 13:18:40,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:40,633 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2022-04-15 13:18:40,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:18:40,633 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 45 [2022-04-15 13:18:40,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 13:18:40,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 13:18:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 13:18:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 13:18:40,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-15 13:18:40,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:40,677 INFO L225 Difference]: With dead ends: 77 [2022-04-15 13:18:40,678 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 13:18:40,678 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:18:40,679 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 18 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:40,679 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 95 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:18:40,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 13:18:40,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-15 13:18:40,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:40,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 13:18:40,747 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 13:18:40,747 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 13:18:40,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:40,751 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-15 13:18:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-15 13:18:40,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:40,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:40,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 75 states. [2022-04-15 13:18:40,752 INFO L87 Difference]: Start difference. First operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 75 states. [2022-04-15 13:18:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:40,755 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-15 13:18:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-15 13:18:40,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:40,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:40,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:40,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 13:18:40,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2022-04-15 13:18:40,759 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 45 [2022-04-15 13:18:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:40,759 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2022-04-15 13:18:40,760 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 13:18:40,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 93 transitions. [2022-04-15 13:18:40,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-15 13:18:40,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 13:18:40,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:40,889 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:18:40,914 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-15 13:18:41,090 WARN L460 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-15 13:18:41,090 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:41,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:41,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1789016266, now seen corresponding path program 1 times [2022-04-15 13:18:41,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:41,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1002568070] [2022-04-15 13:18:56,527 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:18:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash -862809214, now seen corresponding path program 1 times [2022-04-15 13:18:56,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:56,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434378859] [2022-04-15 13:18:56,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:56,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:56,554 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:18:56,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269334072] [2022-04-15 13:18:56,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:56,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:56,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:56,558 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:18:56,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 13:18:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:18:56,595 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 13:18:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 13:18:56,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 13:18:56,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1789016266, now seen corresponding path program 2 times [2022-04-15 13:18:56,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:56,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811803830] [2022-04-15 13:18:56,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:56,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:56,634 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:18:56,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380856051] [2022-04-15 13:18:56,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:18:56,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:56,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:56,655 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:18:56,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 13:18:56,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:18:56,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:18:56,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 13:18:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:56,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:18:57,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {2804#true} call ULTIMATE.init(); {2804#true} is VALID [2022-04-15 13:18:57,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {2804#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(14, 2);call #Ultimate.allocInit(12, 3); {2804#true} is VALID [2022-04-15 13:18:57,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-15 13:18:57,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2804#true} {2804#true} #91#return; {2804#true} is VALID [2022-04-15 13:18:57,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {2804#true} call #t~ret6 := main(); {2804#true} is VALID [2022-04-15 13:18:57,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {2804#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2804#true} is VALID [2022-04-15 13:18:57,050 INFO L272 TraceCheckUtils]: 6: Hoare triple {2804#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2804#true} is VALID [2022-04-15 13:18:57,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-15 13:18:57,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-15 13:18:57,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-15 13:18:57,050 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2804#true} {2804#true} #75#return; {2804#true} is VALID [2022-04-15 13:18:57,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {2804#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:18:57,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !false; {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:18:57,052 INFO L272 TraceCheckUtils]: 13: Hoare triple {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2804#true} is VALID [2022-04-15 13:18:57,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-15 13:18:57,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-15 13:18:57,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-15 13:18:57,053 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2804#true} {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #77#return; {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:18:57,053 INFO L272 TraceCheckUtils]: 18: Hoare triple {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2804#true} is VALID [2022-04-15 13:18:57,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-15 13:18:57,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-15 13:18:57,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-15 13:18:57,054 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2804#true} {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 13:18:57,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {2842#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 13:18:57,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !false; {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 13:18:57,055 INFO L272 TraceCheckUtils]: 25: Hoare triple {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2804#true} is VALID [2022-04-15 13:18:57,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-15 13:18:57,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-15 13:18:57,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-15 13:18:57,056 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2804#true} {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #81#return; {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 13:18:57,056 INFO L272 TraceCheckUtils]: 30: Hoare triple {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2804#true} is VALID [2022-04-15 13:18:57,057 INFO L290 TraceCheckUtils]: 31: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-15 13:18:57,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-15 13:18:57,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-15 13:18:57,058 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2804#true} {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #83#return; {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 13:18:57,058 INFO L272 TraceCheckUtils]: 35: Hoare triple {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2804#true} is VALID [2022-04-15 13:18:57,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-15 13:18:57,058 INFO L290 TraceCheckUtils]: 37: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-15 13:18:57,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-15 13:18:57,059 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2804#true} {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #85#return; {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 13:18:57,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~r~0 >= 2 * ~b~0); {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-15 13:18:57,060 INFO L290 TraceCheckUtils]: 41: Hoare triple {2879#(and (= main_~a~0 1) (= main_~x~0 main_~r~0) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {2934#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-15 13:18:57,060 INFO L290 TraceCheckUtils]: 42: Hoare triple {2934#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} assume !false; {2934#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-15 13:18:57,060 INFO L272 TraceCheckUtils]: 43: Hoare triple {2934#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2804#true} is VALID [2022-04-15 13:18:57,061 INFO L290 TraceCheckUtils]: 44: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-15 13:18:57,061 INFO L290 TraceCheckUtils]: 45: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-15 13:18:57,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-15 13:18:57,061 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2804#true} {2934#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} #77#return; {2934#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} is VALID [2022-04-15 13:18:57,062 INFO L272 TraceCheckUtils]: 48: Hoare triple {2934#(and (= (+ main_~x~0 (* (- 1) main_~r~0)) main_~y~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2956#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:18:57,063 INFO L290 TraceCheckUtils]: 49: Hoare triple {2956#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2960#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:18:57,063 INFO L290 TraceCheckUtils]: 50: Hoare triple {2960#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2805#false} is VALID [2022-04-15 13:18:57,063 INFO L290 TraceCheckUtils]: 51: Hoare triple {2805#false} assume !false; {2805#false} is VALID [2022-04-15 13:18:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 13:18:57,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:18:57,303 INFO L290 TraceCheckUtils]: 51: Hoare triple {2805#false} assume !false; {2805#false} is VALID [2022-04-15 13:18:57,303 INFO L290 TraceCheckUtils]: 50: Hoare triple {2960#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2805#false} is VALID [2022-04-15 13:18:57,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {2956#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2960#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:18:57,305 INFO L272 TraceCheckUtils]: 48: Hoare triple {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2956#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:18:57,306 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2804#true} {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #77#return; {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-15 13:18:57,306 INFO L290 TraceCheckUtils]: 46: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-15 13:18:57,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-15 13:18:57,306 INFO L290 TraceCheckUtils]: 44: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-15 13:18:57,306 INFO L272 TraceCheckUtils]: 43: Hoare triple {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2804#true} is VALID [2022-04-15 13:18:57,306 INFO L290 TraceCheckUtils]: 42: Hoare triple {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !false; {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-15 13:18:57,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-15 13:18:57,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !(~r~0 >= 2 * ~b~0); {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-15 13:18:57,332 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2804#true} {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #85#return; {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-15 13:18:57,332 INFO L290 TraceCheckUtils]: 38: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-15 13:18:57,332 INFO L290 TraceCheckUtils]: 37: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-15 13:18:57,333 INFO L290 TraceCheckUtils]: 36: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-15 13:18:57,333 INFO L272 TraceCheckUtils]: 35: Hoare triple {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2804#true} is VALID [2022-04-15 13:18:57,334 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2804#true} {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #83#return; {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-15 13:18:57,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-15 13:18:57,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-15 13:18:57,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-15 13:18:57,334 INFO L272 TraceCheckUtils]: 30: Hoare triple {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2804#true} is VALID [2022-04-15 13:18:57,335 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2804#true} {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} #81#return; {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-15 13:18:57,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-15 13:18:57,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-15 13:18:57,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-15 13:18:57,336 INFO L272 TraceCheckUtils]: 25: Hoare triple {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2804#true} is VALID [2022-04-15 13:18:57,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} assume !false; {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-15 13:18:57,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2998#(= main_~x~0 (+ main_~r~0 (* (- 1) main_~b~0) (* main_~y~0 (+ main_~a~0 main_~q~0))))} is VALID [2022-04-15 13:18:57,338 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2804#true} {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #79#return; {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-15 13:18:57,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-15 13:18:57,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-15 13:18:57,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-15 13:18:57,338 INFO L272 TraceCheckUtils]: 18: Hoare triple {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2804#true} is VALID [2022-04-15 13:18:57,339 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2804#true} {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} #77#return; {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-15 13:18:57,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-15 13:18:57,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-15 13:18:57,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-15 13:18:57,339 INFO L272 TraceCheckUtils]: 13: Hoare triple {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2804#true} is VALID [2022-04-15 13:18:57,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} assume !false; {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-15 13:18:57,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {2804#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2976#(= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0)} is VALID [2022-04-15 13:18:57,340 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2804#true} {2804#true} #75#return; {2804#true} is VALID [2022-04-15 13:18:57,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-15 13:18:57,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {2804#true} assume !(0 == ~cond); {2804#true} is VALID [2022-04-15 13:18:57,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {2804#true} ~cond := #in~cond; {2804#true} is VALID [2022-04-15 13:18:57,341 INFO L272 TraceCheckUtils]: 6: Hoare triple {2804#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2804#true} is VALID [2022-04-15 13:18:57,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {2804#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2804#true} is VALID [2022-04-15 13:18:57,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {2804#true} call #t~ret6 := main(); {2804#true} is VALID [2022-04-15 13:18:57,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2804#true} {2804#true} #91#return; {2804#true} is VALID [2022-04-15 13:18:57,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {2804#true} assume true; {2804#true} is VALID [2022-04-15 13:18:57,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {2804#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(14, 2);call #Ultimate.allocInit(12, 3); {2804#true} is VALID [2022-04-15 13:18:57,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {2804#true} call ULTIMATE.init(); {2804#true} is VALID [2022-04-15 13:18:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-04-15 13:18:57,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:57,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811803830] [2022-04-15 13:18:57,342 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:18:57,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380856051] [2022-04-15 13:18:57,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380856051] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 13:18:57,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 13:18:57,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2022-04-15 13:18:57,343 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:57,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1002568070] [2022-04-15 13:18:57,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1002568070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:57,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:57,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:18:57,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848538281] [2022-04-15 13:18:57,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:57,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2022-04-15 13:18:57,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:57,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 13:18:57,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:57,385 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:18:57,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:57,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:18:57,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:18:57,386 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 13:18:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:57,769 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2022-04-15 13:18:57,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:18:57,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2022-04-15 13:18:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 13:18:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 13:18:57,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 13:18:57,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-15 13:18:57,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-15 13:18:57,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:57,822 INFO L225 Difference]: With dead ends: 79 [2022-04-15 13:18:57,823 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 13:18:57,823 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:18:57,824 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:57,824 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 79 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:18:57,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 13:18:57,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 13:18:57,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:57,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 13:18:57,825 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 13:18:57,825 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 13:18:57,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:57,825 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 13:18:57,825 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 13:18:57,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:57,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:57,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 13:18:57,826 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 13:18:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:57,826 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 13:18:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 13:18:57,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:57,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:57,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:57,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 13:18:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 13:18:57,826 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-04-15 13:18:57,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:57,827 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 13:18:57,827 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-15 13:18:57,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 13:18:57,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 13:18:57,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:57,829 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 13:18:57,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 13:18:58,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 13:18:58,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:58,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 13:18:58,935 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-15 13:18:58,935 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-15 13:18:58,935 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-15 13:18:58,935 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-15 13:18:58,936 INFO L878 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-15 13:18:58,936 INFO L878 garLoopResultBuilder]: At program point L12-2(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-15 13:18:58,936 INFO L878 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-15 13:18:58,936 INFO L885 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: true [2022-04-15 13:18:58,936 INFO L885 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-15 13:18:58,936 INFO L878 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (<= 1 main_~y~0) [2022-04-15 13:18:58,936 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 22 64) the Hoare annotation is: true [2022-04-15 13:18:58,936 INFO L878 garLoopResultBuilder]: At program point L48(lines 45 57) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-15 13:18:58,936 INFO L878 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-15 13:18:58,936 INFO L878 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-15 13:18:58,936 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 22 64) the Hoare annotation is: true [2022-04-15 13:18:58,936 INFO L878 garLoopResultBuilder]: At program point L38(lines 36 60) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-15 13:18:58,936 INFO L878 garLoopResultBuilder]: At program point L36-2(lines 36 60) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-15 13:18:58,937 INFO L878 garLoopResultBuilder]: At program point L36-3(lines 36 60) the Hoare annotation is: (or (and (= main_~x~0 main_~r~0) (= main_~q~0 0)) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0)))) [2022-04-15 13:18:58,937 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 64) the Hoare annotation is: true [2022-04-15 13:18:58,937 INFO L878 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= (* 2 .cse0) main_~r~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-15 13:18:58,937 INFO L878 garLoopResultBuilder]: At program point L53-1(line 53) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~y~0))) (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= (* 2 .cse0) main_~r~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 .cse0))) [2022-04-15 13:18:58,937 INFO L878 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-15 13:18:58,937 INFO L878 garLoopResultBuilder]: At program point L45-2(lines 45 57) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-15 13:18:58,937 INFO L878 garLoopResultBuilder]: At program point L45-3(lines 45 57) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~r~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-15 13:18:58,937 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-15 13:18:58,937 INFO L878 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (and (= (+ (* main_~q~0 main_~y~0) main_~r~0) main_~x~0) (<= 1 main_~y~0) (= main_~b~0 (* main_~a~0 main_~y~0))) [2022-04-15 13:18:58,937 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 13:18:58,937 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 13:18:58,937 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 13:18:58,938 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 13:18:58,938 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 13:18:58,938 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 13:18:58,938 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 13:18:58,938 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 13:18:58,938 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 13:18:58,938 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-15 13:18:58,938 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 13:18:58,938 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 13:18:58,938 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 13:18:58,940 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 1] [2022-04-15 13:18:58,941 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 13:18:58,943 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 13:18:58,948 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 13:18:58,965 INFO L163 areAnnotationChecker]: CFG has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 13:18:58,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:18:58 BoogieIcfgContainer [2022-04-15 13:18:58,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 13:18:58,974 INFO L158 Benchmark]: Toolchain (without parser) took 28855.74ms. Allocated memory was 176.2MB in the beginning and 220.2MB in the end (delta: 44.0MB). Free memory was 120.9MB in the beginning and 144.4MB in the end (delta: -23.5MB). Peak memory consumption was 102.4MB. Max. memory is 8.0GB. [2022-04-15 13:18:58,975 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:18:58,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.44ms. Allocated memory is still 176.2MB. Free memory was 120.7MB in the beginning and 147.4MB in the end (delta: -26.7MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2022-04-15 13:18:58,975 INFO L158 Benchmark]: Boogie Preprocessor took 27.73ms. Allocated memory is still 176.2MB. Free memory was 147.4MB in the beginning and 145.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 13:18:58,975 INFO L158 Benchmark]: RCFGBuilder took 308.51ms. Allocated memory is still 176.2MB. Free memory was 145.9MB in the beginning and 133.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 13:18:58,975 INFO L158 Benchmark]: TraceAbstraction took 28299.32ms. Allocated memory was 176.2MB in the beginning and 220.2MB in the end (delta: 44.0MB). Free memory was 133.1MB in the beginning and 144.4MB in the end (delta: -11.3MB). Peak memory consumption was 115.0MB. Max. memory is 8.0GB. [2022-04-15 13:18:58,976 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.16ms. Allocated memory is still 176.2MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.44ms. Allocated memory is still 176.2MB. Free memory was 120.7MB in the beginning and 147.4MB in the end (delta: -26.7MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.73ms. Allocated memory is still 176.2MB. Free memory was 147.4MB in the beginning and 145.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 308.51ms. Allocated memory is still 176.2MB. Free memory was 145.9MB in the beginning and 133.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 28299.32ms. Allocated memory was 176.2MB in the beginning and 220.2MB in the end (delta: 44.0MB). Free memory was 133.1MB in the beginning and 144.4MB in the end (delta: -11.3MB). Peak memory consumption was 115.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.2s, OverallIterations: 7, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 735 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 506 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 431 IncrementalHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 229 mSDtfsCounter, 431 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 313 GetRequests, 268 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=6, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 198 PreInvPairs, 292 NumberOfFragments, 328 HoareAnnotationTreeSize, 198 FomulaSimplifications, 88 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 36 FomulaSimplificationsInter, 1196 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((q * y + r == x && 1 <= r) && 1 <= y) && b == a * y - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (q * y + r == x && 1 <= y) && b == a * y - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-15 13:18:59,007 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...