/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de52.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:08:46,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:08:46,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:08:46,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:08:46,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:08:46,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:08:46,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:08:46,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:08:46,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:08:46,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:08:46,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:08:46,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:08:46,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:08:46,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:08:46,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:08:46,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:08:46,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:08:46,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:08:46,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:08:46,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:08:46,410 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:08:46,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:08:46,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:08:46,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:08:46,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:08:46,428 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:08:46,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:08:46,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:08:46,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:08:46,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:08:46,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:08:46,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:08:46,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:08:46,431 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:08:46,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:08:46,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:08:46,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:08:46,433 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:08:46,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:08:46,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:08:46,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:08:46,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:08:46,436 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:08:46,450 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:08:46,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:08:46,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:08:46,451 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:08:46,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:08:46,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:08:46,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:08:46,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:08:46,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:08:46,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:08:46,453 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:08:46,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:08:46,453 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:08:46,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:08:46,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:08:46,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:08:46,454 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:08:46,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:08:46,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:08:46,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:08:46,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:08:46,454 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:08:46,455 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:08:46,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:08:46,455 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:08:46,455 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-08 04:08:46,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:08:46,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:08:46,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:08:46,659 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:08:46,660 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:08:46,661 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-04-08 04:08:46,719 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1cac09ba/600d2d24bf9942c9a6ea6b81a8856189/FLAGb89476ced [2022-04-08 04:08:47,101 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:08:47,101 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-04-08 04:08:47,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1cac09ba/600d2d24bf9942c9a6ea6b81a8856189/FLAGb89476ced [2022-04-08 04:08:47,115 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1cac09ba/600d2d24bf9942c9a6ea6b81a8856189 [2022-04-08 04:08:47,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:08:47,118 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:08:47,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:08:47,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:08:47,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:08:47,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:08:47" (1/1) ... [2022-04-08 04:08:47,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cfe066e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:47, skipping insertion in model container [2022-04-08 04:08:47,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:08:47" (1/1) ... [2022-04-08 04:08:47,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:08:47,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:08:47,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de52.c[368,381] [2022-04-08 04:08:47,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:08:47,391 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:08:47,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de52.c[368,381] [2022-04-08 04:08:47,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:08:47,423 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:08:47,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:47 WrapperNode [2022-04-08 04:08:47,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:08:47,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:08:47,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:08:47,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:08:47,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:47" (1/1) ... [2022-04-08 04:08:47,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:47" (1/1) ... [2022-04-08 04:08:47,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:47" (1/1) ... [2022-04-08 04:08:47,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:47" (1/1) ... [2022-04-08 04:08:47,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:47" (1/1) ... [2022-04-08 04:08:47,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:47" (1/1) ... [2022-04-08 04:08:47,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:47" (1/1) ... [2022-04-08 04:08:47,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:08:47,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:08:47,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:08:47,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:08:47,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:47" (1/1) ... [2022-04-08 04:08:47,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:08:47,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:08:47,488 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-08 04:08:47,500 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-08 04:08:47,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:08:47,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:08:47,533 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:08:47,533 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:08:47,533 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:08:47,534 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:08:47,535 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:08:47,535 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:08:47,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:08:47,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 04:08:47,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:08:47,535 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:08:47,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:08:47,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:08:47,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:08:47,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:08:47,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:08:47,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:08:47,581 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:08:47,583 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:08:47,737 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:08:47,742 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:08:47,742 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-08 04:08:47,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:08:47 BoogieIcfgContainer [2022-04-08 04:08:47,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:08:47,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:08:47,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:08:47,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:08:47,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:08:47" (1/3) ... [2022-04-08 04:08:47,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654954c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:08:47, skipping insertion in model container [2022-04-08 04:08:47,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:47" (2/3) ... [2022-04-08 04:08:47,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654954c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:08:47, skipping insertion in model container [2022-04-08 04:08:47,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:08:47" (3/3) ... [2022-04-08 04:08:47,749 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de52.c [2022-04-08 04:08:47,753 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:08:47,753 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:08:47,786 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:08:47,792 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-08 04:08:47,792 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:08:47,806 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:08:47,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 04:08:47,811 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:08:47,812 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:08:47,812 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:08:47,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:08:47,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 1 times [2022-04-08 04:08:47,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:47,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1382677227] [2022-04-08 04:08:47,833 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:08:47,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 2 times [2022-04-08 04:08:47,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:08:47,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563330761] [2022-04-08 04:08:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:08:47,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:08:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:08:47,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:08:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:08:48,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(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(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-08 04:08:48,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 04:08:48,008 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-08 04:08:48,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:08:48,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(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(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-08 04:08:48,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 04:08:48,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-08 04:08:48,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret15 := main(); {27#true} is VALID [2022-04-08 04:08:48,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27#true} is VALID [2022-04-08 04:08:48,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !(~x~0 % 4294967296 > 0); {27#true} is VALID [2022-04-08 04:08:48,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} ~z~0 := ~y~0; {27#true} is VALID [2022-04-08 04:08:48,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} assume !(~z~0 % 4294967296 > 0); {27#true} is VALID [2022-04-08 04:08:48,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume !(~y~0 % 4294967296 > 0); {27#true} is VALID [2022-04-08 04:08:48,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-08 04:08:48,017 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !(~z~0 % 4294967296 > 0); {28#false} is VALID [2022-04-08 04:08:48,017 INFO L272 TraceCheckUtils]: 12: Hoare triple {28#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-08 04:08:48,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-08 04:08:48,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-08 04:08:48,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-08 04:08:48,020 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-08 04:08:48,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:08:48,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563330761] [2022-04-08 04:08:48,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563330761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:08:48,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:08:48,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:08:48,026 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:08:48,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1382677227] [2022-04-08 04:08:48,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1382677227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:08:48,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:08:48,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:08:48,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792624699] [2022-04-08 04:08:48,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:08:48,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 04:08:48,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:08:48,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:48,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 04:08:48,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:48,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 04:08:48,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:08:48,074 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:48,144 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-04-08 04:08:48,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 04:08:48,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 04:08:48,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:08:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-08 04:08:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-08 04:08:48,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-08 04:08:48,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:48,224 INFO L225 Difference]: With dead ends: 41 [2022-04-08 04:08:48,225 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 04:08:48,227 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-08 04:08:48,230 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:08:48,230 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:08:48,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 04:08:48,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 04:08:48,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:08:48,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,254 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,254 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:48,256 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-08 04:08:48,257 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-08 04:08:48,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:48,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:08:48,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 04:08:48,258 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-08 04:08:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:48,260 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-08 04:08:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-08 04:08:48,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:48,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:08:48,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:08:48,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:08:48,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-04-08 04:08:48,263 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-04-08 04:08:48,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:08:48,263 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-04-08 04:08:48,264 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 21 transitions. [2022-04-08 04:08:48,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-08 04:08:48,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 04:08:48,287 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:08:48,287 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:08:48,288 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:08:48,288 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:08:48,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:08:48,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 1 times [2022-04-08 04:08:48,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:48,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [36504706] [2022-04-08 04:08:48,291 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:08:48,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 2 times [2022-04-08 04:08:48,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:08:48,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60983113] [2022-04-08 04:08:48,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:08:48,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:08:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:08:48,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:08:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:08:48,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#(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(10, 2);call #Ultimate.allocInit(12, 3); {185#true} is VALID [2022-04-08 04:08:48,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-08 04:08:48,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-08 04:08:48,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {185#true} call ULTIMATE.init(); {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:08:48,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#(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(10, 2);call #Ultimate.allocInit(12, 3); {185#true} is VALID [2022-04-08 04:08:48,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-08 04:08:48,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-08 04:08:48,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {185#true} call #t~ret15 := main(); {185#true} is VALID [2022-04-08 04:08:48,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {185#true} is VALID [2022-04-08 04:08:48,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {185#true} assume !(~x~0 % 4294967296 > 0); {185#true} is VALID [2022-04-08 04:08:48,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#true} ~z~0 := ~y~0; {185#true} is VALID [2022-04-08 04:08:48,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {185#true} assume !(~z~0 % 4294967296 > 0); {185#true} is VALID [2022-04-08 04:08:48,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {185#true} assume !(~y~0 % 4294967296 > 0); {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} is VALID [2022-04-08 04:08:48,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} assume !(~x~0 % 4294967296 > 0); {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} is VALID [2022-04-08 04:08:48,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} assume !(~z~0 % 4294967296 > 0); {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} is VALID [2022-04-08 04:08:48,386 INFO L272 TraceCheckUtils]: 12: Hoare triple {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {191#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:08:48,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {191#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {192#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:08:48,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {186#false} is VALID [2022-04-08 04:08:48,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#false} assume !false; {186#false} is VALID [2022-04-08 04:08:48,388 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-08 04:08:48,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:08:48,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60983113] [2022-04-08 04:08:48,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60983113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:08:48,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:08:48,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:08:48,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:08:48,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [36504706] [2022-04-08 04:08:48,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [36504706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:08:48,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:08:48,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:08:48,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132636162] [2022-04-08 04:08:48,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:08:48,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 04:08:48,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:08:48,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:48,410 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:08:48,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:48,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:08:48,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:08:48,411 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:48,635 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-08 04:08:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 04:08:48,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 04:08:48,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:08:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-08 04:08:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-08 04:08:48,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-08 04:08:48,712 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-08 04:08:48,714 INFO L225 Difference]: With dead ends: 34 [2022-04-08 04:08:48,714 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 04:08:48,714 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-08 04:08:48,715 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:08:48,716 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:08:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 04:08:48,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 04:08:48,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:08:48,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,723 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,723 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:48,725 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-04-08 04:08:48,725 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-08 04:08:48,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:48,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:08:48,726 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 04:08:48,726 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-08 04:08:48,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:48,728 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-04-08 04:08:48,728 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-08 04:08:48,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:48,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:08:48,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:08:48,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:08:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-04-08 04:08:48,730 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 16 [2022-04-08 04:08:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:08:48,730 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-04-08 04:08:48,731 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 30 transitions. [2022-04-08 04:08:48,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-08 04:08:48,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 04:08:48,762 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:08:48,762 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:08:48,762 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:08:48,762 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:08:48,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:08:48,763 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 1 times [2022-04-08 04:08:48,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:48,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [717578867] [2022-04-08 04:08:48,764 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:08:48,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 2 times [2022-04-08 04:08:48,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:08:48,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004842541] [2022-04-08 04:08:48,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:08:48,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:08:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:08:48,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:08:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:08:48,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {369#(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(10, 2);call #Ultimate.allocInit(12, 3); {363#true} is VALID [2022-04-08 04:08:48,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#true} assume true; {363#true} is VALID [2022-04-08 04:08:48,846 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363#true} {363#true} #83#return; {363#true} is VALID [2022-04-08 04:08:48,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {363#true} call ULTIMATE.init(); {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:08:48,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#(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(10, 2);call #Ultimate.allocInit(12, 3); {363#true} is VALID [2022-04-08 04:08:48,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {363#true} assume true; {363#true} is VALID [2022-04-08 04:08:48,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363#true} {363#true} #83#return; {363#true} is VALID [2022-04-08 04:08:48,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {363#true} call #t~ret15 := main(); {363#true} is VALID [2022-04-08 04:08:48,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {363#true} is VALID [2022-04-08 04:08:48,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {363#true} assume !(~x~0 % 4294967296 > 0); {363#true} is VALID [2022-04-08 04:08:48,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#true} ~z~0 := ~y~0; {363#true} is VALID [2022-04-08 04:08:48,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {363#true} assume !(~z~0 % 4294967296 > 0); {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-08 04:08:48,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-08 04:08:48,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-08 04:08:48,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {364#false} is VALID [2022-04-08 04:08:48,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {364#false} assume !(~z~0 % 4294967296 > 0); {364#false} is VALID [2022-04-08 04:08:48,856 INFO L272 TraceCheckUtils]: 13: Hoare triple {364#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {364#false} is VALID [2022-04-08 04:08:48,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {364#false} ~cond := #in~cond; {364#false} is VALID [2022-04-08 04:08:48,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {364#false} assume 0 == ~cond; {364#false} is VALID [2022-04-08 04:08:48,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {364#false} assume !false; {364#false} is VALID [2022-04-08 04:08:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:08:48,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:08:48,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004842541] [2022-04-08 04:08:48,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004842541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:08:48,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:08:48,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:08:48,858 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:08:48,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [717578867] [2022-04-08 04:08:48,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [717578867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:08:48,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:08:48,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:08:48,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398979768] [2022-04-08 04:08:48,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:08:48,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 04:08:48,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:08:48,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,877 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-08 04:08:48,878 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 04:08:48,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:48,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 04:08:48,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 04:08:48,879 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:48,969 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-08 04:08:48,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 04:08:48,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 04:08:48,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:08:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-08 04:08:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-08 04:08:48,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-08 04:08:49,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:49,007 INFO L225 Difference]: With dead ends: 34 [2022-04-08 04:08:49,008 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 04:08:49,008 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:08:49,011 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:08:49,015 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 26 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:08:49,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 04:08:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 04:08:49,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:08:49,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:49,032 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:49,032 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:49,034 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-08 04:08:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-08 04:08:49,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:49,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:08:49,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-08 04:08:49,035 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-08 04:08:49,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:49,037 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-08 04:08:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-08 04:08:49,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:49,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:08:49,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:08:49,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:08:49,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-04-08 04:08:49,039 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2022-04-08 04:08:49,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:08:49,040 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-04-08 04:08:49,040 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:49,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 36 transitions. [2022-04-08 04:08:49,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:49,076 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-08 04:08:49,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 04:08:49,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:08:49,077 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:08:49,077 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 04:08:49,077 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:08:49,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:08:49,078 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 1 times [2022-04-08 04:08:49,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:49,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [449913754] [2022-04-08 04:08:49,079 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:08:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 2 times [2022-04-08 04:08:49,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:08:49,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031449941] [2022-04-08 04:08:49,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:08:49,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:08:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:08:49,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:08:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:08:49,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {556#(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(10, 2);call #Ultimate.allocInit(12, 3); {550#true} is VALID [2022-04-08 04:08:49,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-08 04:08:49,124 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {550#true} {550#true} #83#return; {550#true} is VALID [2022-04-08 04:08:49,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {550#true} call ULTIMATE.init(); {556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:08:49,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#(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(10, 2);call #Ultimate.allocInit(12, 3); {550#true} is VALID [2022-04-08 04:08:49,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-08 04:08:49,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {550#true} {550#true} #83#return; {550#true} is VALID [2022-04-08 04:08:49,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {550#true} call #t~ret15 := main(); {550#true} is VALID [2022-04-08 04:08:49,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {550#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {550#true} is VALID [2022-04-08 04:08:49,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {550#true} assume !(~x~0 % 4294967296 > 0); {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 04:08:49,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 04:08:49,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 04:08:49,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-08 04:08:49,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {551#false} is VALID [2022-04-08 04:08:49,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {551#false} assume !(~x~0 % 4294967296 > 0); {551#false} is VALID [2022-04-08 04:08:49,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {551#false} assume !(~z~0 % 4294967296 > 0); {551#false} is VALID [2022-04-08 04:08:49,130 INFO L272 TraceCheckUtils]: 13: Hoare triple {551#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {551#false} is VALID [2022-04-08 04:08:49,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {551#false} ~cond := #in~cond; {551#false} is VALID [2022-04-08 04:08:49,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {551#false} assume 0 == ~cond; {551#false} is VALID [2022-04-08 04:08:49,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {551#false} assume !false; {551#false} is VALID [2022-04-08 04:08:49,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:08:49,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:08:49,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031449941] [2022-04-08 04:08:49,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031449941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:08:49,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:08:49,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:08:49,135 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:08:49,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [449913754] [2022-04-08 04:08:49,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [449913754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:08:49,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:08:49,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:08:49,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126093217] [2022-04-08 04:08:49,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:08:49,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 04:08:49,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:08:49,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:49,151 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-08 04:08:49,152 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 04:08:49,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:49,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 04:08:49,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 04:08:49,153 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:49,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:49,258 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2022-04-08 04:08:49,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 04:08:49,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 04:08:49,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:08:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-08 04:08:49,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:49,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-08 04:08:49,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2022-04-08 04:08:49,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:49,306 INFO L225 Difference]: With dead ends: 43 [2022-04-08 04:08:49,307 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 04:08:49,308 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:08:49,311 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:08:49,312 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 27 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:08:49,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 04:08:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 04:08:49,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:08:49,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:49,338 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:49,338 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:49,346 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-08 04:08:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-08 04:08:49,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:49,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:08:49,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-08 04:08:49,347 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-08 04:08:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:49,349 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-08 04:08:49,349 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-08 04:08:49,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:49,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:08:49,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:08:49,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:08:49,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-04-08 04:08:49,351 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 17 [2022-04-08 04:08:49,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:08:49,351 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-04-08 04:08:49,351 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:08:49,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 43 transitions. [2022-04-08 04:08:49,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:49,401 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-08 04:08:49,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 04:08:49,402 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:08:49,402 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:08:49,402 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 04:08:49,402 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:08:49,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:08:49,403 INFO L85 PathProgramCache]: Analyzing trace with hash 669375650, now seen corresponding path program 1 times [2022-04-08 04:08:49,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:49,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [450415698] [2022-04-08 04:08:49,783 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:08:49,787 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: free variables [|v_main_#t~post8_4|, |v_main_#t~post7_4|] at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.normalizeTerm(PredicateHelper.java:201) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:254) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) 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:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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-08 04:08:49,790 INFO L158 Benchmark]: Toolchain (without parser) took 2671.82ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 129.6MB in the beginning and 114.9MB in the end (delta: 14.8MB). Peak memory consumption was 52.0MB. Max. memory is 8.0GB. [2022-04-08 04:08:49,790 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 181.4MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:08:49,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.05ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 129.3MB in the beginning and 194.7MB in the end (delta: -65.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 04:08:49,791 INFO L158 Benchmark]: Boogie Preprocessor took 36.59ms. Allocated memory is still 218.1MB. Free memory was 194.7MB in the beginning and 193.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 04:08:49,791 INFO L158 Benchmark]: RCFGBuilder took 281.16ms. Allocated memory is still 218.1MB. Free memory was 193.1MB in the beginning and 180.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 04:08:49,792 INFO L158 Benchmark]: TraceAbstraction took 2044.06ms. Allocated memory is still 218.1MB. Free memory was 179.5MB in the beginning and 114.9MB in the end (delta: 64.6MB). Peak memory consumption was 65.7MB. Max. memory is 8.0GB. [2022-04-08 04:08:49,793 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.92ms. Allocated memory is still 181.4MB. Free memory is still 146.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 300.05ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 129.3MB in the beginning and 194.7MB in the end (delta: -65.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.59ms. Allocated memory is still 218.1MB. Free memory was 194.7MB in the beginning and 193.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 281.16ms. Allocated memory is still 218.1MB. Free memory was 193.1MB in the beginning and 180.0MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2044.06ms. Allocated memory is still 218.1MB. Free memory was 179.5MB in the beginning and 114.9MB in the end (delta: 64.6MB). Peak memory consumption was 65.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: free variables [|v_main_#t~post8_4|, |v_main_#t~post7_4|] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: free variables [|v_main_#t~post8_4|, |v_main_#t~post7_4|]: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 04:08:49,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...