/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-scaling/sqrt1-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 17:35:10,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 17:35:10,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 17:35:10,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 17:35:10,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 17:35:10,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 17:35:10,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 17:35:10,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 17:35:10,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 17:35:10,403 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 17:35:10,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 17:35:10,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 17:35:10,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 17:35:10,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 17:35:10,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 17:35:10,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 17:35:10,406 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 17:35:10,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 17:35:10,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 17:35:10,419 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 17:35:10,424 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 17:35:10,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 17:35:10,426 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 17:35:10,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 17:35:10,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 17:35:10,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 17:35:10,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 17:35:10,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 17:35:10,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 17:35:10,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 17:35:10,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 17:35:10,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 17:35:10,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 17:35:10,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 17:35:10,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 17:35:10,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 17:35:10,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 17:35:10,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 17:35:10,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 17:35:10,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 17:35:10,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 17:35:10,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 17:35:10,442 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 17:35:10,453 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 17:35:10,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 17:35:10,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 17:35:10,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 17:35:10,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 17:35:10,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 17:35:10,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 17:35:10,455 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 17:35:10,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 17:35:10,456 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 17:35:10,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 17:35:10,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 17:35:10,456 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 17:35:10,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 17:35:10,456 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 17:35:10,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:35:10,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 17:35:10,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 17:35:10,457 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 17:35:10,457 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 17:35:10,457 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 17:35:10,457 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 17:35:10,457 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 17:35:10,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 17:35:10,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 17:35:10,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 17:35:10,643 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 17:35:10,643 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 17:35:10,644 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound1.c [2022-04-15 17:35:10,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67de657c9/e3abd22ad1094619918609998be00c63/FLAG77d7a6da1 [2022-04-15 17:35:11,032 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 17:35:11,032 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound1.c [2022-04-15 17:35:11,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67de657c9/e3abd22ad1094619918609998be00c63/FLAG77d7a6da1 [2022-04-15 17:35:11,045 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67de657c9/e3abd22ad1094619918609998be00c63 [2022-04-15 17:35:11,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 17:35:11,047 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 17:35:11,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 17:35:11,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 17:35:11,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 17:35:11,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:35:11" (1/1) ... [2022-04-15 17:35:11,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aeb7af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:35:11, skipping insertion in model container [2022-04-15 17:35:11,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:35:11" (1/1) ... [2022-04-15 17:35:11,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 17:35:11,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 17:35:11,184 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-scaling/sqrt1-ll_valuebound1.c[520,533] [2022-04-15 17:35:11,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:35:11,200 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 17:35:11,208 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-scaling/sqrt1-ll_valuebound1.c[520,533] [2022-04-15 17:35:11,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 17:35:11,223 INFO L208 MainTranslator]: Completed translation [2022-04-15 17:35:11,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:35:11 WrapperNode [2022-04-15 17:35:11,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 17:35:11,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 17:35:11,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 17:35:11,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 17:35:11,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:35:11" (1/1) ... [2022-04-15 17:35:11,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:35:11" (1/1) ... [2022-04-15 17:35:11,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:35:11" (1/1) ... [2022-04-15 17:35:11,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:35:11" (1/1) ... [2022-04-15 17:35:11,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:35:11" (1/1) ... [2022-04-15 17:35:11,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:35:11" (1/1) ... [2022-04-15 17:35:11,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:35:11" (1/1) ... [2022-04-15 17:35:11,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 17:35:11,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 17:35:11,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 17:35:11,263 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 17:35:11,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:35:11" (1/1) ... [2022-04-15 17:35:11,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 17:35:11,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:35:11,296 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 17:35:11,298 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 17:35:11,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 17:35:11,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 17:35:11,320 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 17:35:11,320 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 17:35:11,320 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 17:35:11,320 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 17:35:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 17:35:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 17:35:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 17:35:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 17:35:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 17:35:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 17:35:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 17:35:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 17:35:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 17:35:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 17:35:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 17:35:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 17:35:11,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 17:35:11,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 17:35:11,361 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 17:35:11,363 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 17:35:11,471 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 17:35:11,476 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 17:35:11,477 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 17:35:11,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:35:11 BoogieIcfgContainer [2022-04-15 17:35:11,478 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 17:35:11,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 17:35:11,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 17:35:11,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 17:35:11,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:35:11" (1/3) ... [2022-04-15 17:35:11,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e23213b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:35:11, skipping insertion in model container [2022-04-15 17:35:11,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:35:11" (2/3) ... [2022-04-15 17:35:11,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e23213b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:35:11, skipping insertion in model container [2022-04-15 17:35:11,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:35:11" (3/3) ... [2022-04-15 17:35:11,499 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound1.c [2022-04-15 17:35:11,502 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 17:35:11,502 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 17:35:11,556 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 17:35:11,561 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 17:35:11,561 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 17:35:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 17:35:11,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 17:35:11,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:35:11,579 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 17:35:11,580 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:35:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:35:11,598 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 1 times [2022-04-15 17:35:11,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:35:11,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1454160101] [2022-04-15 17:35:11,611 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:35:11,611 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 2 times [2022-04-15 17:35:11,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:35:11,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546578354] [2022-04-15 17:35:11,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:35:11,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:35:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:35:11,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:35:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:35:11,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(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(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-15 17:35:11,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 17:35:11,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-15 17:35:11,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:35:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:35:11,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 17:35:11,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 17:35:11,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 17:35:11,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-15 17:35:11,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:35:11,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(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(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-15 17:35:11,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 17:35:11,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-15 17:35:11,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret5 := main(); {34#true} is VALID [2022-04-15 17:35:11,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {34#true} is VALID [2022-04-15 17:35:11,821 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 1 then 1 else 0)); {34#true} is VALID [2022-04-15 17:35:11,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 17:35:11,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 17:35:11,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 17:35:11,823 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-15 17:35:11,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {35#false} is VALID [2022-04-15 17:35:11,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-15 17:35:11,825 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {35#false} is VALID [2022-04-15 17:35:11,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-15 17:35:11,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-15 17:35:11,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-15 17:35:11,826 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 17:35:11,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:35:11,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546578354] [2022-04-15 17:35:11,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546578354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:35:11,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:35:11,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 17:35:11,830 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:35:11,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1454160101] [2022-04-15 17:35:11,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1454160101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:35:11,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:35:11,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 17:35:11,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199544388] [2022-04-15 17:35:11,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:35:11,836 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 17:35:11,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:35:11,839 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 17:35:11,870 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 17:35:11,870 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 17:35:11,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:35:11,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 17:35:11,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 17:35:11,899 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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 17:35:12,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:35:12,061 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2022-04-15 17:35:12,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 17:35:12,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 17:35:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:35:12,064 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 17:35:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-15 17:35:12,070 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 17:35:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-15 17:35:12,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2022-04-15 17:35:12,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:35:12,176 INFO L225 Difference]: With dead ends: 53 [2022-04-15 17:35:12,177 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 17:35:12,180 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 17:35:12,182 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:35:12,183 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:35:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 17:35:12,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 17:35:12,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:35:12,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 17:35:12,204 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 17:35:12,205 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 17:35:12,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:35:12,208 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-15 17:35:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-15 17:35:12,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:35:12,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:35:12,209 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-15 17:35:12,209 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-15 17:35:12,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:35:12,212 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-15 17:35:12,212 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-15 17:35:12,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:35:12,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:35:12,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:35:12,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:35:12,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 17:35:12,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-15 17:35:12,216 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-15 17:35:12,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:35:12,216 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-15 17:35:12,217 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 17:35:12,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-15 17:35:12,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:35:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-15 17:35:12,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 17:35:12,245 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:35:12,245 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 17:35:12,245 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 17:35:12,246 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:35:12,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:35:12,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 1 times [2022-04-15 17:35:12,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:35:12,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [360172495] [2022-04-15 17:35:12,247 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:35:12,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 2 times [2022-04-15 17:35:12,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:35:12,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863402625] [2022-04-15 17:35:12,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:35:12,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:35:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:35:12,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 17:35:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:35:12,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(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(11, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-15 17:35:12,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-15 17:35:12,320 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID [2022-04-15 17:35:12,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 17:35:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:35:12,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-15 17:35:12,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-15 17:35:12,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-15 17:35:12,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID [2022-04-15 17:35:12,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 17:35:12,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(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(11, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-15 17:35:12,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-15 17:35:12,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID [2022-04-15 17:35:12,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret5 := main(); {256#true} is VALID [2022-04-15 17:35:12,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {256#true} is VALID [2022-04-15 17:35:12,327 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 1 then 1 else 0)); {256#true} is VALID [2022-04-15 17:35:12,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-15 17:35:12,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-15 17:35:12,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-15 17:35:12,327 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID [2022-04-15 17:35:12,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-15 17:35:12,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !false; {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-15 17:35:12,329 INFO L272 TraceCheckUtils]: 13: Hoare triple {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 17:35:12,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 17:35:12,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID [2022-04-15 17:35:12,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-15 17:35:12,330 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 17:35:12,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:35:12,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863402625] [2022-04-15 17:35:12,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863402625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:35:12,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:35:12,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:35:12,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:35:12,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [360172495] [2022-04-15 17:35:12,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [360172495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:35:12,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:35:12,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 17:35:12,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852555471] [2022-04-15 17:35:12,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:35:12,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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 17:35:12,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:35:12,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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 17:35:12,344 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 17:35:12,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 17:35:12,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:35:12,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 17:35:12,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 17:35:12,346 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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 17:35:12,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:35:12,641 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-15 17:35:12,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 17:35:12,641 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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 17:35:12,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:35:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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 17:35:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-15 17:35:12,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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 17:35:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-15 17:35:12,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-15 17:35:12,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:35:12,692 INFO L225 Difference]: With dead ends: 40 [2022-04-15 17:35:12,692 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 17:35:12,693 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 17:35:12,693 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 17:35:12,694 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 39 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 17:35:12,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 17:35:12,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-15 17:35:12,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:35:12,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 17:35:12,702 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 17:35:12,703 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 17:35:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:35:12,705 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-15 17:35:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-15 17:35:12,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:35:12,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:35:12,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-15 17:35:12,707 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-15 17:35:12,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:35:12,709 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-15 17:35:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-15 17:35:12,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:35:12,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:35:12,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:35:12,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:35:12,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 17:35:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-15 17:35:12,712 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17 [2022-04-15 17:35:12,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:35:12,712 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-15 17:35:12,713 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 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 17:35:12,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-15 17:35:12,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:35:12,758 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-15 17:35:12,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 17:35:12,759 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:35:12,759 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 17:35:12,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 17:35:12,759 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:35:12,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:35:12,760 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 1 times [2022-04-15 17:35:12,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:35:12,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1883585978] [2022-04-15 17:35:12,761 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:35:12,761 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 2 times [2022-04-15 17:35:12,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:35:12,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439272290] [2022-04-15 17:35:12,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:35:12,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:35:12,771 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:35:12,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [644745445] [2022-04-15 17:35:12,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 17:35:12,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:35:12,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:35:12,773 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 17:35:12,796 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 17:35:12,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 17:35:12,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:35:12,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 17:35:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:35:12,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:35:12,927 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-15 17:35:12,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#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(11, 2);call #Ultimate.allocInit(12, 3); {507#true} is VALID [2022-04-15 17:35:12,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-15 17:35:12,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #69#return; {507#true} is VALID [2022-04-15 17:35:12,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret5 := main(); {507#true} is VALID [2022-04-15 17:35:12,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {507#true} is VALID [2022-04-15 17:35:12,928 INFO L272 TraceCheckUtils]: 6: Hoare triple {507#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 1 then 1 else 0)); {507#true} is VALID [2022-04-15 17:35:12,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-15 17:35:12,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-15 17:35:12,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-15 17:35:12,929 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {507#true} {507#true} #55#return; {507#true} is VALID [2022-04-15 17:35:12,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {507#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-15 17:35:12,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} assume !false; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-15 17:35:12,930 INFO L272 TraceCheckUtils]: 13: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {507#true} is VALID [2022-04-15 17:35:12,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-15 17:35:12,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-15 17:35:12,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-15 17:35:12,931 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {507#true} {545#(and (= main_~a~0 0) (= main_~s~0 1))} #57#return; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-15 17:35:12,931 INFO L272 TraceCheckUtils]: 18: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {567#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:35:12,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {567#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {571#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:35:12,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {571#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {508#false} is VALID [2022-04-15 17:35:12,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-15 17:35:12,933 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 17:35:12,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 17:35:12,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:35:12,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439272290] [2022-04-15 17:35:12,933 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:35:12,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644745445] [2022-04-15 17:35:12,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644745445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:35:12,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:35:12,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:35:12,934 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:35:12,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1883585978] [2022-04-15 17:35:12,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1883585978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:35:12,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:35:12,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:35:12,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243489446] [2022-04-15 17:35:12,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:35:12,935 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 17:35:12,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:35:12,935 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 17:35:12,949 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 17:35:12,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 17:35:12,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:35:12,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 17:35:12,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:35:12,950 INFO L87 Difference]: Start difference. First operand 36 states and 45 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 17:35:13,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:35:13,068 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-15 17:35:13,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 17:35:13,068 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 17:35:13,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:35:13,069 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 17:35:13,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-15 17:35:13,071 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 17:35:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-15 17:35:13,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-15 17:35:13,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:35:13,122 INFO L225 Difference]: With dead ends: 44 [2022-04-15 17:35:13,122 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 17:35:13,122 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 17:35:13,123 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:35:13,123 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 103 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:35:13,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 17:35:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-15 17:35:13,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:35:13,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 17:35:13,133 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 17:35:13,133 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 17:35:13,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:35:13,135 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-15 17:35:13,135 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-15 17:35:13,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:35:13,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:35:13,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-15 17:35:13,137 INFO L87 Difference]: Start difference. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-15 17:35:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:35:13,139 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-15 17:35:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-15 17:35:13,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:35:13,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:35:13,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:35:13,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:35:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 17:35:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-04-15 17:35:13,141 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2022-04-15 17:35:13,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:35:13,141 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-04-15 17:35:13,142 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 17:35:13,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 50 transitions. [2022-04-15 17:35:13,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:35:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-15 17:35:13,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 17:35:13,186 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:35:13,186 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] [2022-04-15 17:35:13,223 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 17:35:13,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:35:13,411 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:35:13,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:35:13,411 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 1 times [2022-04-15 17:35:13,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:35:13,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1354194304] [2022-04-15 17:35:13,412 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 17:35:13,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 2 times [2022-04-15 17:35:13,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:35:13,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781801990] [2022-04-15 17:35:13,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:35:13,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:35:13,421 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:35:13,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [458341147] [2022-04-15 17:35:13,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 17:35:13,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:35:13,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:35:13,422 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 17:35:13,423 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 17:35:13,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 17:35:13,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 17:35:13,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 17:35:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:35:13,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:35:13,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {833#true} is VALID [2022-04-15 17:35:13,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#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(11, 2);call #Ultimate.allocInit(12, 3); {833#true} is VALID [2022-04-15 17:35:13,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-15 17:35:13,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #69#return; {833#true} is VALID [2022-04-15 17:35:13,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret5 := main(); {833#true} is VALID [2022-04-15 17:35:13,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {833#true} is VALID [2022-04-15 17:35:13,546 INFO L272 TraceCheckUtils]: 6: Hoare triple {833#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 1 then 1 else 0)); {833#true} is VALID [2022-04-15 17:35:13,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-15 17:35:13,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-15 17:35:13,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-15 17:35:13,546 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {833#true} {833#true} #55#return; {833#true} is VALID [2022-04-15 17:35:13,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {833#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 17:35:13,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} assume !false; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 17:35:13,547 INFO L272 TraceCheckUtils]: 13: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {833#true} is VALID [2022-04-15 17:35:13,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-15 17:35:13,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-15 17:35:13,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-15 17:35:13,548 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {833#true} {871#(and (= main_~t~0 1) (= main_~s~0 1))} #57#return; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 17:35:13,548 INFO L272 TraceCheckUtils]: 18: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {833#true} is VALID [2022-04-15 17:35:13,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-15 17:35:13,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-15 17:35:13,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-15 17:35:13,549 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {833#true} {871#(and (= main_~t~0 1) (= main_~s~0 1))} #59#return; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-15 17:35:13,550 INFO L272 TraceCheckUtils]: 23: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:35:13,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:35:13,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {834#false} is VALID [2022-04-15 17:35:13,551 INFO L290 TraceCheckUtils]: 26: Hoare triple {834#false} assume !false; {834#false} is VALID [2022-04-15 17:35:13,551 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 17:35:13,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 17:35:13,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:35:13,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781801990] [2022-04-15 17:35:13,551 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:35:13,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458341147] [2022-04-15 17:35:13,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458341147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:35:13,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:35:13,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:35:13,552 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:35:13,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1354194304] [2022-04-15 17:35:13,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1354194304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:35:13,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:35:13,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:35:13,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036406895] [2022-04-15 17:35:13,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:35:13,553 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-15 17:35:13,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:35:13,553 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 17:35:13,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:35:13,568 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 17:35:13,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 17:35:13,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 17:35:13,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 17:35:13,569 INFO L87 Difference]: Start difference. First operand 41 states and 50 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 17:35:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:35:13,681 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-15 17:35:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 17:35:13,681 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-15 17:35:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 17:35:13,682 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 17:35:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-15 17:35:13,683 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 17:35:13,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-15 17:35:13,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-15 17:35:13,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:35:13,721 INFO L225 Difference]: With dead ends: 48 [2022-04-15 17:35:13,721 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 17:35:13,721 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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 17:35:13,722 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 17:35:13,722 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 17:35:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 17:35:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-15 17:35:13,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 17:35:13,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 17:35:13,734 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 17:35:13,734 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 17:35:13,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:35:13,735 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-15 17:35:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-15 17:35:13,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:35:13,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:35:13,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-15 17:35:13,736 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-15 17:35:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 17:35:13,738 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-15 17:35:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-15 17:35:13,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 17:35:13,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 17:35:13,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 17:35:13,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 17:35:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 17:35:13,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-15 17:35:13,740 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2022-04-15 17:35:13,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 17:35:13,740 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-15 17:35:13,740 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 17:35:13,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 48 transitions. [2022-04-15 17:35:13,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 17:35:13,779 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-15 17:35:13,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 17:35:13,780 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 17:35:13,780 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 17:35:13,796 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 17:35:13,992 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,SelfDestructingSolverStorable3 [2022-04-15 17:35:13,993 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 17:35:13,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 17:35:13,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 1 times [2022-04-15 17:35:13,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 17:35:13,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [196614958] [2022-04-15 17:35:14,636 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 17:35:14,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1589942244, now seen corresponding path program 1 times [2022-04-15 17:35:14,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 17:35:14,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820329142] [2022-04-15 17:35:14,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:35:14,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 17:35:14,646 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 17:35:14,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [228336818] [2022-04-15 17:35:14,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 17:35:14,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:35:14,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 17:35:14,647 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 17:35:14,707 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 17:35:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:35:14,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 17:35:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 17:35:14,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 17:35:14,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-15 17:35:14,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#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(11, 2);call #Ultimate.allocInit(12, 3); {1188#true} is VALID [2022-04-15 17:35:14,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-15 17:35:14,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #69#return; {1188#true} is VALID [2022-04-15 17:35:14,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID [2022-04-15 17:35:14,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1188#true} is VALID [2022-04-15 17:35:14,815 INFO L272 TraceCheckUtils]: 6: Hoare triple {1188#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 1 then 1 else 0)); {1188#true} is VALID [2022-04-15 17:35:14,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-15 17:35:14,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-15 17:35:14,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-15 17:35:14,816 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1188#true} {1188#true} #55#return; {1188#true} is VALID [2022-04-15 17:35:14,816 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-15 17:35:14,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} [73] L30-2-->L31_primed: Formula: (or (let ((.cse0 (* 2 v_main_~a~0_Out_2)) (.cse3 (* (- 1) v_main_~t~0_In_1)) (.cse1 (* v_main_~a~0_Out_2 v_main_~a~0_Out_2))) (and (= (mod (+ v_main_~t~0_In_1 v_main_~t~0_Out_2) 2) 0) (= (+ .cse0 1) v_main_~t~0_Out_2) (<= .cse1 v_main_~n~0_In_1) (= .cse0 0) (= (+ (- 1) (let ((.cse2 (+ (- 1) .cse0))) (* .cse2 .cse2)) (* .cse1 (- 4)) (* v_main_~a~0_Out_2 4)) 0) (= .cse0 (* 2 v_main_~a~0_In_1)) (= (+ (* (- 1) v_main_~t~0_Out_2) (* v_main_~s~0_Out_2 2)) (+ (* v_main_~s~0_In_1 2) .cse3)) (<= 0 (div (+ v_main_~t~0_Out_2 .cse3) 2)) (= v_main_~s~0_Out_2 (+ .cse1 v_main_~t~0_Out_2)))) (and (= v_main_~t~0_In_1 v_main_~t~0_Out_2) (= v_main_~a~0_In_1 v_main_~a~0_Out_2) (= v_main_~n~0_In_1 v_main_~n~0_In_1) (= v_main_~s~0_In_1 v_main_~s~0_Out_2))) InVars {main_~t~0=v_main_~t~0_In_1, main_~n~0=v_main_~n~0_In_1, main_~s~0=v_main_~s~0_In_1, main_~a~0=v_main_~a~0_In_1} OutVars{main_~t~0=v_main_~t~0_Out_2, main_~n~0=v_main_~n~0_In_1, main_~s~0=v_main_~s~0_Out_2, main_~a~0=v_main_~a~0_Out_2} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-15 17:35:14,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} [72] L31_primed-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-15 17:35:14,818 INFO L272 TraceCheckUtils]: 14: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1236#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 17:35:14,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {1236#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1240#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 17:35:14,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {1240#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-15 17:35:14,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-15 17:35:14,819 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 17:35:14,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 17:35:14,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 17:35:14,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820329142] [2022-04-15 17:35:14,820 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 17:35:14,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228336818] [2022-04-15 17:35:14,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228336818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:35:14,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:35:14,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 17:35:14,978 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 17:35:14,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [196614958] [2022-04-15 17:35:14,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [196614958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 17:35:14,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 17:35:14,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 17:35:14,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003528762] [2022-04-15 17:35:14,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 17:35:14,979 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 34 [2022-04-15 17:35:14,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 17:35:14,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 17:35:15,003 WARN L143 InductivityCheck]: Transition 1251#(and (<= main_~s~0 (+ main_~n~0 main_~t~0)) (= (+ (* main_~t~0 6) (- 3) (* main_~s~0 (- 4)) (* (+ (- 2) main_~t~0) (+ (- 2) main_~t~0))) 0)) ( _ , assume !false; , 1226#(and (= main_~a~0 0) (= main_~t~0 1)) ) not inductive [2022-04-15 17:35:15,035 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 17:35:15,238 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 17:35:15,239 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 17:35:15,242 INFO L158 Benchmark]: Toolchain (without parser) took 4194.46ms. Allocated memory was 127.9MB in the beginning and 176.2MB in the end (delta: 48.2MB). Free memory was 77.3MB in the beginning and 104.3MB in the end (delta: -27.0MB). Peak memory consumption was 21.5MB. Max. memory is 8.0GB. [2022-04-15 17:35:15,242 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 93.5MB in the beginning and 93.4MB in the end (delta: 78.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 17:35:15,242 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.27ms. Allocated memory was 127.9MB in the beginning and 176.2MB in the end (delta: 48.2MB). Free memory was 77.1MB in the beginning and 152.4MB in the end (delta: -75.3MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-04-15 17:35:15,242 INFO L158 Benchmark]: Boogie Preprocessor took 37.70ms. Allocated memory is still 176.2MB. Free memory was 152.4MB in the beginning and 150.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 17:35:15,242 INFO L158 Benchmark]: RCFGBuilder took 215.64ms. Allocated memory is still 176.2MB. Free memory was 150.9MB in the beginning and 140.2MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 17:35:15,243 INFO L158 Benchmark]: TraceAbstraction took 3746.96ms. Allocated memory is still 176.2MB. Free memory was 139.6MB in the beginning and 104.3MB in the end (delta: 35.3MB). Peak memory consumption was 35.8MB. Max. memory is 8.0GB. [2022-04-15 17:35:15,244 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.12ms. Allocated memory is still 127.9MB. Free memory was 93.5MB in the beginning and 93.4MB in the end (delta: 78.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 175.27ms. Allocated memory was 127.9MB in the beginning and 176.2MB in the end (delta: 48.2MB). Free memory was 77.1MB in the beginning and 152.4MB in the end (delta: -75.3MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.70ms. Allocated memory is still 176.2MB. Free memory was 152.4MB in the beginning and 150.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 215.64ms. Allocated memory is still 176.2MB. Free memory was 150.9MB in the beginning and 140.2MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3746.96ms. Allocated memory is still 176.2MB. Free memory was 139.6MB in the beginning and 104.3MB in the end (delta: 35.3MB). Peak memory consumption was 35.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 17:35:15,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...