./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-40.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 b12a87112e893e06b4108602efb156c6b105d83d4f27cdd9d3121a96ce033332 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:47:56,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:47:56,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:47:56,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:47:56,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:47:56,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:47:56,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:47:56,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:47:56,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:47:56,168 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:47:56,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:47:56,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:47:56,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:47:56,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:47:56,173 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:47:56,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:47:56,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:47:56,174 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:47:56,174 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:47:56,174 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:47:56,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:47:56,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:47:56,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:47:56,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:47:56,175 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:47:56,176 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:47:56,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:47:56,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:47:56,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:47:56,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:47:56,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:47:56,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:47:56,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:47:56,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:47:56,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:47:56,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:47:56,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:47:56,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:47:56,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:47:56,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:47:56,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:47:56,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:47:56,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 -> b12a87112e893e06b4108602efb156c6b105d83d4f27cdd9d3121a96ce033332 [2024-11-08 22:47:56,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:47:56,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:47:56,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:47:56,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:47:56,457 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:47:56,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-40.i [2024-11-08 22:47:57,878 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:47:58,064 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:47:58,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-40.i [2024-11-08 22:47:58,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fee7a56f/5672c430dc784499b3edcaa93fcd319b/FLAG24ebf4dfd [2024-11-08 22:47:58,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fee7a56f/5672c430dc784499b3edcaa93fcd319b [2024-11-08 22:47:58,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:47:58,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:47:58,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:47:58,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:47:58,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:47:58,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:47:58" (1/1) ... [2024-11-08 22:47:58,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78eb153d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:47:58, skipping insertion in model container [2024-11-08 22:47:58,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:47:58" (1/1) ... [2024-11-08 22:47:58,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:47:58,366 WARN L250 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_fillercode_fillercodestructure_normal_file-40.i[913,926] [2024-11-08 22:47:58,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:47:58,430 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:47:58,442 WARN L250 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_fillercode_fillercodestructure_normal_file-40.i[913,926] [2024-11-08 22:47:58,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:47:58,487 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:47:58,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:47:58 WrapperNode [2024-11-08 22:47:58,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:47:58,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:47:58,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:47:58,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:47:58,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:47:58" (1/1) ... [2024-11-08 22:47:58,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:47:58" (1/1) ... [2024-11-08 22:47:58,539 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2024-11-08 22:47:58,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:47:58,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:47:58,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:47:58,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:47:58,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:47:58" (1/1) ... [2024-11-08 22:47:58,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:47:58" (1/1) ... [2024-11-08 22:47:58,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:47:58" (1/1) ... [2024-11-08 22:47:58,578 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-11-08 22:47:58,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:47:58" (1/1) ... [2024-11-08 22:47:58,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:47:58" (1/1) ... [2024-11-08 22:47:58,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:47:58" (1/1) ... [2024-11-08 22:47:58,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:47:58" (1/1) ... [2024-11-08 22:47:58,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:47:58" (1/1) ... [2024-11-08 22:47:58,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:47:58" (1/1) ... [2024-11-08 22:47:58,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:47:58,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:47:58,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:47:58,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:47:58,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:47:58" (1/1) ... [2024-11-08 22:47:58,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:47:58,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:47:58,640 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-11-08 22:47:58,643 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-11-08 22:47:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:47:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:47:58,691 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:47:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:47:58,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:47:58,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:47:58,756 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:47:58,758 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:47:59,066 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 22:47:59,067 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:47:59,089 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:47:59,089 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:47:59,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:47:59 BoogieIcfgContainer [2024-11-08 22:47:59,090 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:47:59,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:47:59,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:47:59,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:47:59,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:47:58" (1/3) ... [2024-11-08 22:47:59,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fadb09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:47:59, skipping insertion in model container [2024-11-08 22:47:59,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:47:58" (2/3) ... [2024-11-08 22:47:59,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fadb09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:47:59, skipping insertion in model container [2024-11-08 22:47:59,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:47:59" (3/3) ... [2024-11-08 22:47:59,102 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-40.i [2024-11-08 22:47:59,116 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:47:59,116 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:47:59,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:47:59,173 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;@f77ab9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:47:59,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:47:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 22:47:59,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 22:47:59,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:47:59,190 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:47:59,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:47:59,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:47:59,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1284550771, now seen corresponding path program 1 times [2024-11-08 22:47:59,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:47:59,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992379408] [2024-11-08 22:47:59,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:47:59,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:47:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:47:59,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:47:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:47:59,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:47:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:47:59,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 22:47:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:47:59,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:47:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:47:59,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 22:47:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:47:59,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:47:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:47:59,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:47:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:47:59,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:47:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:47:59,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 22:47:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:47:59,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:47:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:47:59,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 22:47:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:47:59,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:47:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:47:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 22:47:59,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:47:59,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992379408] [2024-11-08 22:47:59,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992379408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:47:59,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:47:59,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:47:59,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158626503] [2024-11-08 22:47:59,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:47:59,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:47:59,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:47:59,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:47:59,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:47:59,669 INFO L87 Difference]: Start difference. First operand has 50 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 22:47:59,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:47:59,697 INFO L93 Difference]: Finished difference Result 93 states and 152 transitions. [2024-11-08 22:47:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:47:59,700 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 85 [2024-11-08 22:47:59,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:47:59,708 INFO L225 Difference]: With dead ends: 93 [2024-11-08 22:47:59,709 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 22:47:59,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-11-08 22:47:59,717 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:47:59,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:47:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 22:47:59,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-08 22:47:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 22:47:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-08 22:47:59,764 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 85 [2024-11-08 22:47:59,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:47:59,766 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-08 22:47:59,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 22:47:59,767 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-08 22:47:59,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 22:47:59,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:47:59,772 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:47:59,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:47:59,773 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:47:59,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:47:59,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1365721472, now seen corresponding path program 1 times [2024-11-08 22:47:59,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:47:59,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597239790] [2024-11-08 22:47:59,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:47:59,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:47:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:48:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:48:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 22:48:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:48:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 22:48:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:48:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:48:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:48:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 22:48:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:48:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 22:48:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:48:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 22:48:00,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:48:00,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597239790] [2024-11-08 22:48:00,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597239790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:48:00,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:48:00,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:48:00,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21424809] [2024-11-08 22:48:00,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:48:00,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:48:00,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:48:00,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:48:00,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:48:00,090 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 22:48:00,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:48:00,118 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2024-11-08 22:48:00,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:48:00,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-08 22:48:00,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:48:00,124 INFO L225 Difference]: With dead ends: 89 [2024-11-08 22:48:00,124 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 22:48:00,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-11-08 22:48:00,130 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:48:00,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:48:00,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 22:48:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-08 22:48:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 22:48:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-11-08 22:48:00,146 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 86 [2024-11-08 22:48:00,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:48:00,147 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-11-08 22:48:00,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 22:48:00,147 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-11-08 22:48:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 22:48:00,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:48:00,149 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:48:00,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:48:00,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:48:00,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:48:00,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2119899198, now seen corresponding path program 1 times [2024-11-08 22:48:00,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:48:00,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523282333] [2024-11-08 22:48:00,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:48:00,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:48:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:48:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:48:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 22:48:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:48:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 22:48:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:48:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 22:48:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:48:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 22:48:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:48:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 22:48:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:48:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 22:48:00,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:48:00,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523282333] [2024-11-08 22:48:00,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523282333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:48:00,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:48:00,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 22:48:00,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742141086] [2024-11-08 22:48:00,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:48:00,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 22:48:00,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:48:00,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 22:48:00,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 22:48:00,691 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 22:48:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:48:01,112 INFO L93 Difference]: Finished difference Result 169 states and 234 transitions. [2024-11-08 22:48:01,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 22:48:01,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-08 22:48:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:48:01,115 INFO L225 Difference]: With dead ends: 169 [2024-11-08 22:48:01,115 INFO L226 Difference]: Without dead ends: 126 [2024-11-08 22:48:01,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 22:48:01,119 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 118 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 22:48:01,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 224 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 22:48:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-08 22:48:01,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 79. [2024-11-08 22:48:01,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 56 states have internal predecessors, (68), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 22:48:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 110 transitions. [2024-11-08 22:48:01,151 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 110 transitions. Word has length 86 [2024-11-08 22:48:01,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:48:01,154 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 110 transitions. [2024-11-08 22:48:01,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 22:48:01,154 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. [2024-11-08 22:48:01,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 22:48:01,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:48:01,156 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:48:01,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:48:01,156 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:48:01,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:48:01,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2121746240, now seen corresponding path program 1 times [2024-11-08 22:48:01,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:48:01,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886358269] [2024-11-08 22:48:01,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:48:01,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:48:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:48:01,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [683357900] [2024-11-08 22:48:01,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:48:01,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:48:01,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:48:01,256 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-11-08 22:48:01,258 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-11-08 22:48:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:48:01,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:48:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:48:01,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:48:01,488 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:48:01,489 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:48:01,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 22:48:01,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:48:01,695 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 22:48:01,772 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:48:01,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:48:01 BoogieIcfgContainer [2024-11-08 22:48:01,775 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:48:01,776 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:48:01,776 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:48:01,776 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:48:01,777 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:47:59" (3/4) ... [2024-11-08 22:48:01,780 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:48:01,782 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:48:01,782 INFO L158 Benchmark]: Toolchain (without parser) took 3689.28ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 95.8MB in the beginning and 204.7MB in the end (delta: -108.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:48:01,783 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 113.2MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:48:01,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.80ms. Allocated memory is still 165.7MB. Free memory was 95.6MB in the beginning and 129.7MB in the end (delta: -34.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 22:48:01,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.44ms. Allocated memory is still 165.7MB. Free memory was 129.7MB in the beginning and 126.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:48:01,785 INFO L158 Benchmark]: Boogie Preprocessor took 59.58ms. Allocated memory is still 165.7MB. Free memory was 126.1MB in the beginning and 119.2MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 22:48:01,785 INFO L158 Benchmark]: RCFGBuilder took 490.01ms. Allocated memory is still 165.7MB. Free memory was 119.2MB in the beginning and 98.1MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 22:48:01,786 INFO L158 Benchmark]: TraceAbstraction took 2681.24ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 97.5MB in the beginning and 204.7MB in the end (delta: -107.2MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. [2024-11-08 22:48:01,787 INFO L158 Benchmark]: Witness Printer took 5.99ms. Allocated memory is still 245.4MB. Free memory is still 204.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:48:01,789 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.09ms. Allocated memory is still 113.2MB. Free memory is still 76.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.80ms. Allocated memory is still 165.7MB. Free memory was 95.6MB in the beginning and 129.7MB in the end (delta: -34.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.44ms. Allocated memory is still 165.7MB. Free memory was 129.7MB in the beginning and 126.1MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.58ms. Allocated memory is still 165.7MB. Free memory was 126.1MB in the beginning and 119.2MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 490.01ms. Allocated memory is still 165.7MB. Free memory was 119.2MB in the beginning and 98.1MB in the end (delta: 21.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2681.24ms. Allocated memory was 165.7MB in the beginning and 245.4MB in the end (delta: 79.7MB). Free memory was 97.5MB in the beginning and 204.7MB in the end (delta: -107.2MB). Peak memory consumption was 60.4MB. Max. memory is 16.1GB. * Witness Printer took 5.99ms. Allocated memory is still 245.4MB. Free memory is still 204.7MB. There was no memory consumed. 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 someBinaryFLOATComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someUnaryDOUBLEoperation at line 35. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] unsigned char last_1_var_1_9 = 1; [L38] float last_1_var_1_24 = 128.5; VAL [isInitial=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=-200, var_1_8=5, var_1_9=1] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L102] last_1_var_1_9 = var_1_9 [L103] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=-200, var_1_8=5, var_1_9=1] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L82] var_1_4 = __VERIFIER_nondet_short() [L83] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L83] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L84] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L84] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L85] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L85] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=5, var_1_9=1] [L86] var_1_8 = __VERIFIER_nondet_ushort() [L87] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_9=1] [L87] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_9=1] [L88] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L88] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L89] var_1_10 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L91] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L91] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L92] var_1_11 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L94] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L94] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L95] var_1_15 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L96] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L97] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L97] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L98] var_1_20 = __VERIFIER_nondet_float() [L99] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L99] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L114] RET updateVariables() [L115] CALL step() [L42] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L49] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L51] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=1] [L52] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L53] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_4=1, var_1_8=0, var_1_9=0] [L55] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L56] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L59] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L61] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L62] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L65] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L69] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L70] var_1_25 = var_1_20 [L71] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=0, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=0, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L72] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L73] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L77] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-256, var_1_15=-256, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_4=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 411 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 203 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 152 IncrementalHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 208 mSDtfsCounter, 152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=3, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 47 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 397 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 792/792 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-11-08 22:48:01,821 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/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-40.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 b12a87112e893e06b4108602efb156c6b105d83d4f27cdd9d3121a96ce033332 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:48:03,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:48:04,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:48:04,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:48:04,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:48:04,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:48:04,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:48:04,060 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:48:04,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:48:04,061 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:48:04,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:48:04,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:48:04,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:48:04,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:48:04,063 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:48:04,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:48:04,065 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:48:04,066 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:48:04,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:48:04,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:48:04,070 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:48:04,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:48:04,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:48:04,073 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:48:04,073 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:48:04,075 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:48:04,075 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:48:04,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:48:04,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:48:04,076 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:48:04,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:48:04,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:48:04,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:48:04,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:48:04,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:48:04,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:48:04,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:48:04,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:48:04,086 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:48:04,086 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:48:04,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:48:04,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:48:04,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:48:04,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:48:04,087 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 -> b12a87112e893e06b4108602efb156c6b105d83d4f27cdd9d3121a96ce033332 [2024-11-08 22:48:04,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:48:04,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:48:04,435 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:48:04,437 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:48:04,437 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:48:04,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-40.i [2024-11-08 22:48:05,855 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:48:06,089 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:48:06,090 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-40.i [2024-11-08 22:48:06,102 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dd52e6db/d1db71a3ba604dd195a1ef6ad16ec584/FLAG98de7f556 [2024-11-08 22:48:06,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dd52e6db/d1db71a3ba604dd195a1ef6ad16ec584 [2024-11-08 22:48:06,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:48:06,441 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:48:06,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:48:06,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:48:06,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:48:06,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:48:06" (1/1) ... [2024-11-08 22:48:06,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73012132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:48:06, skipping insertion in model container [2024-11-08 22:48:06,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:48:06" (1/1) ... [2024-11-08 22:48:06,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:48:06,668 WARN L250 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_fillercode_fillercodestructure_normal_file-40.i[913,926] [2024-11-08 22:48:06,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:48:06,764 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:48:06,777 WARN L250 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_fillercode_fillercodestructure_normal_file-40.i[913,926] [2024-11-08 22:48:06,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:48:06,841 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:48:06,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:48:06 WrapperNode [2024-11-08 22:48:06,842 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:48:06,843 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:48:06,843 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:48:06,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:48:06,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:48:06" (1/1) ... [2024-11-08 22:48:06,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:48:06" (1/1) ... [2024-11-08 22:48:06,902 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2024-11-08 22:48:06,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:48:06,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:48:06,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:48:06,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:48:06,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:48:06" (1/1) ... [2024-11-08 22:48:06,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:48:06" (1/1) ... [2024-11-08 22:48:06,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:48:06" (1/1) ... [2024-11-08 22:48:06,945 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-11-08 22:48:06,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:48:06" (1/1) ... [2024-11-08 22:48:06,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:48:06" (1/1) ... [2024-11-08 22:48:06,960 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:48:06" (1/1) ... [2024-11-08 22:48:06,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:48:06" (1/1) ... [2024-11-08 22:48:06,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:48:06" (1/1) ... [2024-11-08 22:48:06,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:48:06" (1/1) ... [2024-11-08 22:48:06,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:48:06,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:48:06,974 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:48:06,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:48:06,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:48:06" (1/1) ... [2024-11-08 22:48:06,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:48:06,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:48:07,017 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-11-08 22:48:07,020 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-11-08 22:48:07,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:48:07,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:48:07,069 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:48:07,070 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:48:07,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:48:07,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:48:07,161 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:48:07,164 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:48:07,643 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 22:48:07,644 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:48:07,660 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:48:07,660 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:48:07,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:48:07 BoogieIcfgContainer [2024-11-08 22:48:07,661 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:48:07,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:48:07,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:48:07,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:48:07,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:48:06" (1/3) ... [2024-11-08 22:48:07,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdec4ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:48:07, skipping insertion in model container [2024-11-08 22:48:07,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:48:06" (2/3) ... [2024-11-08 22:48:07,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdec4ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:48:07, skipping insertion in model container [2024-11-08 22:48:07,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:48:07" (3/3) ... [2024-11-08 22:48:07,670 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-40.i [2024-11-08 22:48:07,686 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:48:07,687 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:48:07,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:48:07,757 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;@6726f656, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:48:07,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:48:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 22:48:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-08 22:48:07,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:48:07,772 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:48:07,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:48:07,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:48:07,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1284550771, now seen corresponding path program 1 times [2024-11-08 22:48:07,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:48:07,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257696954] [2024-11-08 22:48:07,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:48:07,792 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-11-08 22:48:07,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:48:07,795 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-11-08 22:48:07,796 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-11-08 22:48:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:08,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:48:08,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:48:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-08 22:48:08,126 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:48:08,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:48:08,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257696954] [2024-11-08 22:48:08,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257696954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:48:08,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:48:08,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:48:08,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043203468] [2024-11-08 22:48:08,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:48:08,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:48:08,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:48:08,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:48:08,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:48:08,161 INFO L87 Difference]: Start difference. First operand has 50 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 22:48:08,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:48:08,187 INFO L93 Difference]: Finished difference Result 93 states and 152 transitions. [2024-11-08 22:48:08,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:48:08,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 85 [2024-11-08 22:48:08,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:48:08,198 INFO L225 Difference]: With dead ends: 93 [2024-11-08 22:48:08,198 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 22:48:08,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 84 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-11-08 22:48:08,207 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:48:08,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:48:08,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 22:48:08,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-08 22:48:08,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 22:48:08,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-08 22:48:08,252 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 85 [2024-11-08 22:48:08,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:48:08,253 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-08 22:48:08,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 22:48:08,253 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-08 22:48:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 22:48:08,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:48:08,258 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:48:08,268 INFO L552 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)] Ended with exit code 0 [2024-11-08 22:48:08,462 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-11-08 22:48:08,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:48:08,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:48:08,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1365721472, now seen corresponding path program 1 times [2024-11-08 22:48:08,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:48:08,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305546381] [2024-11-08 22:48:08,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:48:08,465 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-11-08 22:48:08,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:48:08,468 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-11-08 22:48:08,470 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-11-08 22:48:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:08,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 22:48:08,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:48:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 22:48:08,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:48:08,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:48:08,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305546381] [2024-11-08 22:48:08,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305546381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:48:08,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:48:08,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:48:08,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495435486] [2024-11-08 22:48:08,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:48:08,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:48:08,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:48:08,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:48:08,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:48:08,763 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 22:48:08,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:48:08,888 INFO L93 Difference]: Finished difference Result 89 states and 127 transitions. [2024-11-08 22:48:08,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:48:08,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-08 22:48:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:48:08,898 INFO L225 Difference]: With dead ends: 89 [2024-11-08 22:48:08,898 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 22:48:08,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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-11-08 22:48:08,900 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:48:08,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:48:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 22:48:08,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-08 22:48:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 22:48:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2024-11-08 22:48:08,909 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 86 [2024-11-08 22:48:08,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:48:08,914 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2024-11-08 22:48:08,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 22:48:08,914 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2024-11-08 22:48:08,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 22:48:08,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:48:08,916 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:48:08,926 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 (3)] Forceful destruction successful, exit code 0 [2024-11-08 22:48:09,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-11-08 22:48:09,117 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:48:09,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:48:09,118 INFO L85 PathProgramCache]: Analyzing trace with hash 2119899198, now seen corresponding path program 1 times [2024-11-08 22:48:09,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:48:09,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163266188] [2024-11-08 22:48:09,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:48:09,119 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-11-08 22:48:09,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:48:09,137 INFO L229 MonitoredProcess]: Starting monitored process 4 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-11-08 22:48:09,140 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 (4)] Waiting until timeout for monitored process [2024-11-08 22:48:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:09,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 22:48:09,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:48:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 22:48:09,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:48:09,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:48:09,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163266188] [2024-11-08 22:48:09,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163266188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:48:09,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:48:09,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:48:09,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590868624] [2024-11-08 22:48:09,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:48:09,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:48:09,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:48:09,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:48:09,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:48:09,590 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 22:48:10,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:48:10,640 INFO L93 Difference]: Finished difference Result 190 states and 261 transitions. [2024-11-08 22:48:10,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 22:48:10,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-11-08 22:48:10,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:48:10,643 INFO L225 Difference]: With dead ends: 190 [2024-11-08 22:48:10,643 INFO L226 Difference]: Without dead ends: 147 [2024-11-08 22:48:10,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:48:10,645 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 152 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:48:10,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 226 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 22:48:10,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-08 22:48:10,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 88. [2024-11-08 22:48:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 61 states have internal predecessors, (73), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 22:48:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 121 transitions. [2024-11-08 22:48:10,681 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 121 transitions. Word has length 86 [2024-11-08 22:48:10,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:48:10,682 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 121 transitions. [2024-11-08 22:48:10,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 22:48:10,682 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2024-11-08 22:48:10,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-08 22:48:10,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:48:10,684 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 22:48:10,695 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 (4)] Forceful destruction successful, exit code 0 [2024-11-08 22:48:10,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-11-08 22:48:10,886 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:48:10,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:48:10,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2121746240, now seen corresponding path program 1 times [2024-11-08 22:48:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:48:10,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053618222] [2024-11-08 22:48:10,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:48:10,887 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-11-08 22:48:10,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:48:10,890 INFO L229 MonitoredProcess]: Starting monitored process 5 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-11-08 22:48:10,892 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 (5)] Waiting until timeout for monitored process [2024-11-08 22:48:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:48:11,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 22:48:11,094 INFO L278 TraceCheckSpWp]: Computing forward predicates...