./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3528376fb447b7e4334860ab48f714a16089e5384cb298e6197e1f3cf82dfcc6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:52:26,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:52:26,149 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 23:52:26,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:52:26,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:52:26,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:52:26,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:52:26,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:52:26,170 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:52:26,172 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:52:26,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:52:26,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:52:26,172 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:52:26,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:52:26,173 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:52:26,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:52:26,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:52:26,173 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 23:52:26,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 23:52:26,174 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 23:52:26,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:52:26,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:52:26,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:52:26,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:52:26,175 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:52:26,176 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 23:52:26,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:52:26,177 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:52:26,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:52:26,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:52:26,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:52:26,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:52:26,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:52:26,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:52:26,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:52:26,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:52:26,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 23:52:26,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 23:52:26,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:52:26,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:52:26,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:52:26,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:52:26,180 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3528376fb447b7e4334860ab48f714a16089e5384cb298e6197e1f3cf82dfcc6 [2024-10-12 23:52:26,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:52:26,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:52:26,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:52:26,387 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:52:26,387 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:52:26,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i [2024-10-12 23:52:27,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:52:27,687 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:52:27,688 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i [2024-10-12 23:52:27,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa8343903/c07ee81754c54debb72839a14c77dbd0/FLAGed4839bd7 [2024-10-12 23:52:27,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa8343903/c07ee81754c54debb72839a14c77dbd0 [2024-10-12 23:52:27,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:52:27,708 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:52:27,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:52:27,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:52:27,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:52:27,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:52:27" (1/1) ... [2024-10-12 23:52:27,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd4f73a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:52:27, skipping insertion in model container [2024-10-12 23:52:27,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:52:27" (1/1) ... [2024-10-12 23:52:27,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:52:27,863 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i[919,932] [2024-10-12 23:52:27,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:52:27,902 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:52:27,911 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i[919,932] [2024-10-12 23:52:27,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:52:27,981 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:52:27,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:52:27 WrapperNode [2024-10-12 23:52:27,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:52:27,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:52:27,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:52:27,982 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:52:27,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:52:27" (1/1) ... [2024-10-12 23:52:28,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:52:27" (1/1) ... [2024-10-12 23:52:28,040 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-10-12 23:52:28,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:52:28,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:52:28,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:52:28,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:52:28,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:52:27" (1/1) ... [2024-10-12 23:52:28,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:52:27" (1/1) ... [2024-10-12 23:52:28,053 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:52:27" (1/1) ... [2024-10-12 23:52:28,068 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 23:52:28,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:52:27" (1/1) ... [2024-10-12 23:52:28,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:52:27" (1/1) ... [2024-10-12 23:52:28,080 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:52:27" (1/1) ... [2024-10-12 23:52:28,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:52:27" (1/1) ... [2024-10-12 23:52:28,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:52:27" (1/1) ... [2024-10-12 23:52:28,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:52:27" (1/1) ... [2024-10-12 23:52:28,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:52:28,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:52:28,093 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:52:28,093 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:52:28,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:52:27" (1/1) ... [2024-10-12 23:52:28,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:52:28,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:52:28,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:52:28,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:52:28,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:52:28,163 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 23:52:28,164 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 23:52:28,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 23:52:28,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:52:28,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:52:28,236 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:52:28,238 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:52:28,492 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-12 23:52:28,493 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:52:28,537 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:52:28,537 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:52:28,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:52:28 BoogieIcfgContainer [2024-10-12 23:52:28,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:52:28,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:52:28,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:52:28,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:52:28,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:52:27" (1/3) ... [2024-10-12 23:52:28,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c41a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:52:28, skipping insertion in model container [2024-10-12 23:52:28,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:52:27" (2/3) ... [2024-10-12 23:52:28,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c41a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:52:28, skipping insertion in model container [2024-10-12 23:52:28,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:52:28" (3/3) ... [2024-10-12 23:52:28,548 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-66.i [2024-10-12 23:52:28,562 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:52:28,562 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:52:28,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:52:28,609 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@fc389, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:52:28,609 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:52:28,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 32 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-12 23:52:28,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 23:52:28,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:52:28,625 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:52:28,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:52:28,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:52:28,629 INFO L85 PathProgramCache]: Analyzing trace with hash -292743724, now seen corresponding path program 1 times [2024-10-12 23:52:28,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:52:28,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450383872] [2024-10-12 23:52:28,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:52:28,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:52:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:52:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:52:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:52:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:52:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:52:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:52:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:52:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:52:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:52:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:52:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:52:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:52:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:52:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:52:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:52:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 23:52:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 23:52:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 23:52:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-12 23:52:28,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:52:28,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450383872] [2024-10-12 23:52:28,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450383872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:52:28,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:52:28,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:52:28,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460396093] [2024-10-12 23:52:28,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:52:28,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 23:52:28,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:52:28,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 23:52:28,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:52:28,943 INFO L87 Difference]: Start difference. First operand has 52 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 32 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-12 23:52:28,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:52:28,987 INFO L93 Difference]: Finished difference Result 101 states and 184 transitions. [2024-10-12 23:52:28,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 23:52:28,989 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 112 [2024-10-12 23:52:28,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:52:28,995 INFO L225 Difference]: With dead ends: 101 [2024-10-12 23:52:28,995 INFO L226 Difference]: Without dead ends: 50 [2024-10-12 23:52:28,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:52:29,002 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:52:29,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:52:29,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-12 23:52:29,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-12 23:52:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-12 23:52:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 79 transitions. [2024-10-12 23:52:29,031 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 79 transitions. Word has length 112 [2024-10-12 23:52:29,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:52:29,032 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 79 transitions. [2024-10-12 23:52:29,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-12 23:52:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 79 transitions. [2024-10-12 23:52:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 23:52:29,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:52:29,034 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:52:29,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 23:52:29,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:52:29,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:52:29,035 INFO L85 PathProgramCache]: Analyzing trace with hash 362592020, now seen corresponding path program 1 times [2024-10-12 23:52:29,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:52:29,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235287369] [2024-10-12 23:52:29,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:52:29,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:52:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:52:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:52:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:52:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:52:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:52:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:52:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:52:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:52:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:52:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:52:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:52:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:52:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:52:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:52:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:52:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 23:52:48,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 23:52:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 23:52:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-12 23:52:48,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:52:48,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235287369] [2024-10-12 23:52:48,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235287369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:52:48,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:52:48,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 23:52:48,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895603268] [2024-10-12 23:52:48,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:52:48,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 23:52:48,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:52:48,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 23:52:48,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:52:48,166 INFO L87 Difference]: Start difference. First operand 50 states and 79 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-12 23:52:48,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:52:48,823 INFO L93 Difference]: Finished difference Result 172 states and 268 transitions. [2024-10-12 23:52:48,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 23:52:48,825 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2024-10-12 23:52:48,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:52:48,828 INFO L225 Difference]: With dead ends: 172 [2024-10-12 23:52:48,828 INFO L226 Difference]: Without dead ends: 123 [2024-10-12 23:52:48,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2024-10-12 23:52:48,831 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 106 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 23:52:48,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 289 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 23:52:48,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-12 23:52:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 87. [2024-10-12 23:52:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.5) internal successors, (93), 63 states have internal predecessors, (93), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-12 23:52:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2024-10-12 23:52:48,853 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 112 [2024-10-12 23:52:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:52:48,854 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2024-10-12 23:52:48,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-12 23:52:48,854 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2024-10-12 23:52:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 23:52:48,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:52:48,856 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:52:48,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 23:52:48,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:52:48,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:52:48,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1042650390, now seen corresponding path program 1 times [2024-10-12 23:52:48,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:52:48,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029708256] [2024-10-12 23:52:48,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:52:48,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:52:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:52:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:52:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:52:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:52:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:52:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:52:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:52:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:52:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:52:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:52:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:52:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:52:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:52:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:52:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:52:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 23:52:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 23:52:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 23:52:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-12 23:52:48,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:52:48,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029708256] [2024-10-12 23:52:48,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029708256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:52:48,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:52:48,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 23:52:48,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131362607] [2024-10-12 23:52:48,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:52:48,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 23:52:48,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:52:48,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 23:52:48,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:52:48,957 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-12 23:52:49,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:52:49,007 INFO L93 Difference]: Finished difference Result 243 states and 384 transitions. [2024-10-12 23:52:49,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 23:52:49,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2024-10-12 23:52:49,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:52:49,010 INFO L225 Difference]: With dead ends: 243 [2024-10-12 23:52:49,010 INFO L226 Difference]: Without dead ends: 157 [2024-10-12 23:52:49,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 23:52:49,015 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 69 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:52:49,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 200 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:52:49,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-12 23:52:49,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2024-10-12 23:52:49,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 106 states have (on average 1.4056603773584906) internal successors, (149), 108 states have internal predecessors, (149), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-12 23:52:49,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 237 transitions. [2024-10-12 23:52:49,043 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 237 transitions. Word has length 112 [2024-10-12 23:52:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:52:49,044 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 237 transitions. [2024-10-12 23:52:49,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-12 23:52:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 237 transitions. [2024-10-12 23:52:49,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 23:52:49,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:52:49,047 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:52:49,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 23:52:49,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:52:49,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:52:49,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1099908692, now seen corresponding path program 1 times [2024-10-12 23:52:49,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:52:49,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537839862] [2024-10-12 23:52:49,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:52:49,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:52:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:52:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:52:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:52:49,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:52:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:52:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:52:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:52:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:52:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:52:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:52:49,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:52:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:52:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:52:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:52:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:52:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 23:52:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 23:52:49,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 23:52:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:52:49,166 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-12 23:52:49,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:52:49,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537839862] [2024-10-12 23:52:49,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537839862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:52:49,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:52:49,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:52:49,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344802978] [2024-10-12 23:52:49,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:52:49,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:52:49,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:52:49,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:52:49,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:52:49,168 INFO L87 Difference]: Start difference. First operand 155 states and 237 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-12 23:52:49,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:52:49,291 INFO L93 Difference]: Finished difference Result 463 states and 694 transitions. [2024-10-12 23:52:49,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:52:49,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2024-10-12 23:52:49,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:52:49,294 INFO L225 Difference]: With dead ends: 463 [2024-10-12 23:52:49,294 INFO L226 Difference]: Without dead ends: 309 [2024-10-12 23:52:49,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:52:49,295 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 63 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:52:49,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 188 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:52:49,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-12 23:52:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 270. [2024-10-12 23:52:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 177 states have (on average 1.3615819209039548) internal successors, (241), 180 states have internal predecessors, (241), 84 states have call successors, (84), 8 states have call predecessors, (84), 8 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-12 23:52:49,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 409 transitions. [2024-10-12 23:52:49,323 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 409 transitions. Word has length 112 [2024-10-12 23:52:49,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:52:49,324 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 409 transitions. [2024-10-12 23:52:49,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-12 23:52:49,324 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 409 transitions. [2024-10-12 23:52:49,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 23:52:49,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:52:49,328 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:52:49,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 23:52:49,328 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:52:49,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:52:49,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1420051242, now seen corresponding path program 1 times [2024-10-12 23:52:49,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:52:49,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804902151] [2024-10-12 23:52:49,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:52:49,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:52:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:53:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:53:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:53:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:53:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:53:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:53:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:53:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:53:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:53:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:53:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:53:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:53:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:53:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:53:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:53:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 23:53:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 23:53:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 23:53:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-12 23:53:02,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:53:02,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804902151] [2024-10-12 23:53:02,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804902151] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:53:02,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:53:02,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 23:53:02,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892920326] [2024-10-12 23:53:02,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:53:02,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 23:53:02,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:53:02,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 23:53:02,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-12 23:53:02,353 INFO L87 Difference]: Start difference. First operand 270 states and 409 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-12 23:53:02,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:53:02,897 INFO L93 Difference]: Finished difference Result 396 states and 567 transitions. [2024-10-12 23:53:02,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 23:53:02,897 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2024-10-12 23:53:02,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:53:02,900 INFO L225 Difference]: With dead ends: 396 [2024-10-12 23:53:02,901 INFO L226 Difference]: Without dead ends: 394 [2024-10-12 23:53:02,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2024-10-12 23:53:02,904 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 153 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 23:53:02,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 289 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 23:53:02,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-12 23:53:02,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 306. [2024-10-12 23:53:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 207 states have (on average 1.3478260869565217) internal successors, (279), 212 states have internal predecessors, (279), 88 states have call successors, (88), 10 states have call predecessors, (88), 10 states have return successors, (88), 83 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-12 23:53:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 455 transitions. [2024-10-12 23:53:02,941 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 455 transitions. Word has length 112 [2024-10-12 23:53:02,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:53:02,942 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 455 transitions. [2024-10-12 23:53:02,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-12 23:53:02,943 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 455 transitions. [2024-10-12 23:53:02,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 23:53:02,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:53:02,944 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:53:02,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 23:53:02,945 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:53:02,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:53:02,945 INFO L85 PathProgramCache]: Analyzing trace with hash -30434990, now seen corresponding path program 1 times [2024-10-12 23:53:02,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:53:02,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994382413] [2024-10-12 23:53:02,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:02,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:53:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 23:53:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 23:53:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 23:53:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-12 23:53:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-12 23:53:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 23:53:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 23:53:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 23:53:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 23:53:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 23:53:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 23:53:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 23:53:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 23:53:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 23:53:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 23:53:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 23:53:03,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 23:53:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 23:53:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-12 23:53:03,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 23:53:03,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994382413] [2024-10-12 23:53:03,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994382413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:53:03,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:53:03,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 23:53:03,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302502570] [2024-10-12 23:53:03,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:53:03,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 23:53:03,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 23:53:03,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 23:53:03,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 23:53:03,168 INFO L87 Difference]: Start difference. First operand 306 states and 455 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-12 23:53:03,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:53:03,306 INFO L93 Difference]: Finished difference Result 603 states and 878 transitions. [2024-10-12 23:53:03,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 23:53:03,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 112 [2024-10-12 23:53:03,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:53:03,311 INFO L225 Difference]: With dead ends: 603 [2024-10-12 23:53:03,311 INFO L226 Difference]: Without dead ends: 338 [2024-10-12 23:53:03,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 23:53:03,313 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 110 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 23:53:03,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 106 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 23:53:03,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-12 23:53:03,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 331. [2024-10-12 23:53:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 218 states have (on average 1.275229357798165) internal successors, (278), 224 states have internal predecessors, (278), 98 states have call successors, (98), 14 states have call predecessors, (98), 14 states have return successors, (98), 92 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-12 23:53:03,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 474 transitions. [2024-10-12 23:53:03,353 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 474 transitions. Word has length 112 [2024-10-12 23:53:03,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:53:03,354 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 474 transitions. [2024-10-12 23:53:03,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-12 23:53:03,354 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 474 transitions. [2024-10-12 23:53:03,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-12 23:53:03,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:53:03,355 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:53:03,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 23:53:03,355 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:53:03,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:53:03,356 INFO L85 PathProgramCache]: Analyzing trace with hash 203301695, now seen corresponding path program 1 times [2024-10-12 23:53:03,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 23:53:03,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243653288] [2024-10-12 23:53:03,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:03,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 23:53:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 23:53:03,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [865673445] [2024-10-12 23:53:03,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:03,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:53:03,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:53:03,405 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 23:53:03,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 23:53:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:53:03,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 23:53:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 23:53:03,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 23:53:03,601 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 23:53:03,602 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 23:53:03,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 23:53:03,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 23:53:03,812 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:53:03,864 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 23:53:03,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 11:53:03 BoogieIcfgContainer [2024-10-12 23:53:03,870 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 23:53:03,870 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 23:53:03,870 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 23:53:03,871 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 23:53:03,871 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:52:28" (3/4) ... [2024-10-12 23:53:03,872 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 23:53:03,873 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 23:53:03,873 INFO L158 Benchmark]: Toolchain (without parser) took 36165.04ms. Allocated memory was 163.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 96.5MB in the beginning and 805.3MB in the end (delta: -708.8MB). Peak memory consumption was 321.2MB. Max. memory is 16.1GB. [2024-10-12 23:53:03,873 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 102.8MB. Free memory is still 66.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 23:53:03,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.94ms. Allocated memory is still 163.6MB. Free memory was 96.3MB in the beginning and 134.6MB in the end (delta: -38.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-12 23:53:03,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.96ms. Allocated memory is still 163.6MB. Free memory was 134.6MB in the beginning and 131.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 23:53:03,874 INFO L158 Benchmark]: Boogie Preprocessor took 49.86ms. Allocated memory is still 163.6MB. Free memory was 131.3MB in the beginning and 127.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 23:53:03,874 INFO L158 Benchmark]: RCFGBuilder took 445.51ms. Allocated memory is still 163.6MB. Free memory was 127.1MB in the beginning and 103.9MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-12 23:53:03,874 INFO L158 Benchmark]: TraceAbstraction took 35330.72ms. Allocated memory was 163.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 103.4MB in the beginning and 806.3MB in the end (delta: -702.9MB). Peak memory consumption was 326.3MB. Max. memory is 16.1GB. [2024-10-12 23:53:03,875 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 1.2GB. Free memory was 806.3MB in the beginning and 805.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 23:53:03,876 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 102.8MB. Free memory is still 66.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.94ms. Allocated memory is still 163.6MB. Free memory was 96.3MB in the beginning and 134.6MB in the end (delta: -38.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.96ms. Allocated memory is still 163.6MB. Free memory was 134.6MB in the beginning and 131.3MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.86ms. Allocated memory is still 163.6MB. Free memory was 131.3MB in the beginning and 127.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 445.51ms. Allocated memory is still 163.6MB. Free memory was 127.1MB in the beginning and 103.9MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 35330.72ms. Allocated memory was 163.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 103.4MB in the beginning and 806.3MB in the end (delta: -702.9MB). Peak memory consumption was 326.3MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 1.2GB. Free memory was 806.3MB in the beginning and 805.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 115. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] signed char var_1_3 = 8; [L24] signed char var_1_4 = 10; [L25] double var_1_5 = 16.5; [L26] signed char var_1_6 = 64; [L27] signed char var_1_7 = 2; [L28] unsigned short int var_1_8 = 256; [L29] unsigned short int var_1_10 = 63583; [L30] unsigned short int var_1_11 = 33789; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_14 = 0; [L33] signed long int var_1_15 = 8; [L34] signed short int var_1_16 = -16; [L35] signed short int var_1_18 = 16; [L36] signed short int var_1_19 = 25; [L37] signed short int var_1_20 = 25; [L38] signed short int var_1_21 = 50; [L39] unsigned char last_1_var_1_12 = 1; [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] CALL updateLastVariables() [L112] last_1_var_1_12 = var_1_12 [L122] RET updateLastVariables() [L123] CALL updateVariables() [L83] var_1_3 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L84] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L85] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L85] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L86] var_1_4 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L87] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L88] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L88] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L89] var_1_6 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L90] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L91] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L91] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L92] var_1_7 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L93] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L94] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L94] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L95] var_1_10 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L96] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L97] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L97] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L98] var_1_11 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L99] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L100] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L100] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L101] var_1_14 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L102] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L103] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L103] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L104] var_1_20 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L105] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L106] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L106] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=50, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L107] var_1_21 = __VERIFIER_nondet_short() [L108] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=63, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=63, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L108] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=63, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L109] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=63, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=63, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L109] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=63, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=256] [L123] RET updateVariables() [L124] CALL step() [L43] COND FALSE !(-25 == var_1_6) [L48] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=63, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=32767] [L50] COND TRUE var_1_8 >= var_1_7 [L51] var_1_12 = (! var_1_14) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=63, var_1_21=63, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=32767] [L53] COND TRUE \read(var_1_12) [L54] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-64, var_1_20=63, var_1_21=63, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=32767] [L56] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-64, var_1_20=63, var_1_21=63, var_1_3=-63, var_1_4=-1, var_1_5=33/2, var_1_6=-1, var_1_7=0, var_1_8=32767] [L57] COND TRUE \read(var_1_12) [L58] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-64, var_1_20=63, var_1_21=63, var_1_3=-63, var_1_4=-1, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=32767] [L61] COND TRUE var_1_1 < var_1_6 [L62] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-1, var_1_19=25, var_1_1=-64, var_1_20=63, var_1_21=63, var_1_3=-63, var_1_4=-1, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=32767] [L66] COND TRUE \read(var_1_12) [L67] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-1, var_1_19=-64, var_1_1=-64, var_1_20=63, var_1_21=63, var_1_3=-63, var_1_4=-1, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=32767] [L69] COND TRUE -64 > (var_1_6 + var_1_19) [L70] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=32767, var_1_16=-16, var_1_18=-1, var_1_19=-64, var_1_1=-64, var_1_20=63, var_1_21=63, var_1_3=-63, var_1_4=-1, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=32767] [L78] COND FALSE !(var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=32767, var_1_16=-16, var_1_18=-1, var_1_19=-64, var_1_1=-64, var_1_20=63, var_1_21=63, var_1_3=-63, var_1_4=-1, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=32767] [L124] RET step() [L125] CALL, EXPR property() [L115-L116] return (((((((var_1_12 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_12 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((last_1_var_1_12 && last_1_var_1_12) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_19)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_12 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=32767, var_1_16=-16, var_1_18=-1, var_1_19=-64, var_1_1=-64, var_1_20=63, var_1_21=63, var_1_3=-63, var_1_4=-1, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=-32769, var_1_12=1, var_1_14=0, var_1_15=32767, var_1_16=-16, var_1_18=-1, var_1_19=-64, var_1_1=-64, var_1_20=63, var_1_21=63, var_1_3=-63, var_1_4=-1, var_1_5=33/4, var_1_6=-1, var_1_7=0, var_1_8=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.2s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 501 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 501 mSDsluCounter, 1148 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 617 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 667 IncrementalHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 531 mSDtfsCounter, 667 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=331occurred in iteration=6, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 172 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 32.5s InterpolantComputationTime, 898 NumberOfCodeBlocks, 898 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 666 ConstructedInterpolants, 0 QuantifiedInterpolants, 3863 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 3672/3672 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-12 23:53:03,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3528376fb447b7e4334860ab48f714a16089e5384cb298e6197e1f3cf82dfcc6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 23:53:05,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 23:53:05,718 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-12 23:53:05,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 23:53:05,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 23:53:05,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 23:53:05,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 23:53:05,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 23:53:05,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 23:53:05,739 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 23:53:05,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 23:53:05,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 23:53:05,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 23:53:05,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 23:53:05,740 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 23:53:05,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 23:53:05,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 23:53:05,741 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 23:53:05,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 23:53:05,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 23:53:05,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 23:53:05,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 23:53:05,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 23:53:05,742 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 23:53:05,743 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 23:53:05,743 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 23:53:05,743 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 23:53:05,743 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 23:53:05,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 23:53:05,743 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 23:53:05,744 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 23:53:05,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 23:53:05,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 23:53:05,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 23:53:05,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:53:05,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 23:53:05,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 23:53:05,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 23:53:05,748 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 23:53:05,748 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 23:53:05,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 23:53:05,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 23:53:05,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 23:53:05,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 23:53:05,750 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 23:53:05,750 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3528376fb447b7e4334860ab48f714a16089e5384cb298e6197e1f3cf82dfcc6 [2024-10-12 23:53:05,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 23:53:06,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 23:53:06,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 23:53:06,017 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 23:53:06,017 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 23:53:06,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i [2024-10-12 23:53:07,202 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 23:53:07,351 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 23:53:07,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i [2024-10-12 23:53:07,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01d55b8a1/895150f646c44937b57c1c36c090f785/FLAG679a8d547 [2024-10-12 23:53:07,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01d55b8a1/895150f646c44937b57c1c36c090f785 [2024-10-12 23:53:07,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 23:53:07,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 23:53:07,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 23:53:07,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 23:53:07,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 23:53:07,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:53:07" (1/1) ... [2024-10-12 23:53:07,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c0c163 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:07, skipping insertion in model container [2024-10-12 23:53:07,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 11:53:07" (1/1) ... [2024-10-12 23:53:07,400 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 23:53:07,549 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i[919,932] [2024-10-12 23:53:07,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:53:07,609 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 23:53:07,621 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-66.i[919,932] [2024-10-12 23:53:07,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 23:53:07,662 INFO L204 MainTranslator]: Completed translation [2024-10-12 23:53:07,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:07 WrapperNode [2024-10-12 23:53:07,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 23:53:07,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 23:53:07,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 23:53:07,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 23:53:07,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:07" (1/1) ... [2024-10-12 23:53:07,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:07" (1/1) ... [2024-10-12 23:53:07,701 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-10-12 23:53:07,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 23:53:07,706 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 23:53:07,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 23:53:07,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 23:53:07,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:07" (1/1) ... [2024-10-12 23:53:07,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:07" (1/1) ... [2024-10-12 23:53:07,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:07" (1/1) ... [2024-10-12 23:53:07,744 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 23:53:07,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:07" (1/1) ... [2024-10-12 23:53:07,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:07" (1/1) ... [2024-10-12 23:53:07,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:07" (1/1) ... [2024-10-12 23:53:07,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:07" (1/1) ... [2024-10-12 23:53:07,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:07" (1/1) ... [2024-10-12 23:53:07,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:07" (1/1) ... [2024-10-12 23:53:07,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 23:53:07,772 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 23:53:07,773 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 23:53:07,773 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 23:53:07,773 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:07" (1/1) ... [2024-10-12 23:53:07,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 23:53:07,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 23:53:07,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 23:53:07,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 23:53:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 23:53:07,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 23:53:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 23:53:07,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 23:53:07,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 23:53:07,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 23:53:07,925 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 23:53:07,927 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 23:53:08,214 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-12 23:53:08,214 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 23:53:08,259 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 23:53:08,259 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 23:53:08,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:53:08 BoogieIcfgContainer [2024-10-12 23:53:08,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 23:53:08,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 23:53:08,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 23:53:08,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 23:53:08,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 11:53:07" (1/3) ... [2024-10-12 23:53:08,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1812ab50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:53:08, skipping insertion in model container [2024-10-12 23:53:08,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 11:53:07" (2/3) ... [2024-10-12 23:53:08,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1812ab50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 11:53:08, skipping insertion in model container [2024-10-12 23:53:08,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 11:53:08" (3/3) ... [2024-10-12 23:53:08,268 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-66.i [2024-10-12 23:53:08,282 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 23:53:08,283 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 23:53:08,336 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 23:53:08,344 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54ada190, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 23:53:08,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 23:53:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 32 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-12 23:53:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 23:53:08,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:53:08,360 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:53:08,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:53:08,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:53:08,365 INFO L85 PathProgramCache]: Analyzing trace with hash -292743724, now seen corresponding path program 1 times [2024-10-12 23:53:08,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:53:08,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196725406] [2024-10-12 23:53:08,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:08,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:53:08,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:53:08,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:53:08,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 23:53:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:08,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 23:53:08,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 23:53:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-10-12 23:53:08,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 23:53:08,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 23:53:08,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196725406] [2024-10-12 23:53:08,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196725406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 23:53:08,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 23:53:08,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 23:53:08,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882786179] [2024-10-12 23:53:08,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 23:53:08,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 23:53:08,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 23:53:08,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 23:53:08,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:53:08,584 INFO L87 Difference]: Start difference. First operand has 52 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 32 states have internal predecessors, (48), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-12 23:53:08,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 23:53:08,635 INFO L93 Difference]: Finished difference Result 101 states and 184 transitions. [2024-10-12 23:53:08,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 23:53:08,640 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 112 [2024-10-12 23:53:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 23:53:08,645 INFO L225 Difference]: With dead ends: 101 [2024-10-12 23:53:08,645 INFO L226 Difference]: Without dead ends: 50 [2024-10-12 23:53:08,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 23:53:08,651 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 23:53:08,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 23:53:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-12 23:53:08,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-12 23:53:08,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-12 23:53:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 79 transitions. [2024-10-12 23:53:08,681 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 79 transitions. Word has length 112 [2024-10-12 23:53:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 23:53:08,682 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 79 transitions. [2024-10-12 23:53:08,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-12 23:53:08,682 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 79 transitions. [2024-10-12 23:53:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 23:53:08,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 23:53:08,684 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 23:53:08,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-12 23:53:08,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:53:08,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 23:53:08,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 23:53:08,890 INFO L85 PathProgramCache]: Analyzing trace with hash 362592020, now seen corresponding path program 1 times [2024-10-12 23:53:08,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 23:53:08,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572323028] [2024-10-12 23:53:08,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 23:53:08,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 23:53:08,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 23:53:08,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 23:53:08,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-12 23:53:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 23:53:09,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 23:53:09,065 INFO L278 TraceCheckSpWp]: Computing forward predicates...