./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.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 91502c696c3817feb6a83b9fc9ac9f8d3ae7404690c12bcf1fe920d76454d132 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:42:08,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:42:08,424 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 07:42:08,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:42:08,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:42:08,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:42:08,455 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:42:08,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:42:08,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:42:08,457 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:42:08,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:42:08,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:42:08,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:42:08,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:42:08,460 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:42:08,460 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:42:08,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:42:08,461 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:42:08,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:42:08,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:42:08,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:42:08,465 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:42:08,465 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:42:08,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:42:08,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:42:08,465 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:42:08,466 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:42:08,466 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:42:08,466 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:42:08,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:42:08,466 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:42:08,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:42:08,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:42:08,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:42:08,467 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:42:08,467 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:42:08,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:42:08,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:42:08,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:42:08,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:42:08,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:42:08,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:42:08,469 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 -> 91502c696c3817feb6a83b9fc9ac9f8d3ae7404690c12bcf1fe920d76454d132 [2024-10-14 07:42:08,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:42:08,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:42:08,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:42:08,733 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:42:08,737 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:42:08,738 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i [2024-10-14 07:42:10,134 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:42:10,314 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:42:10,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i [2024-10-14 07:42:10,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d86f11f4/c053214d75b946849a441f5a6ca03a83/FLAG997583e42 [2024-10-14 07:42:10,339 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d86f11f4/c053214d75b946849a441f5a6ca03a83 [2024-10-14 07:42:10,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:42:10,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:42:10,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:42:10,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:42:10,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:42:10,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:42:10" (1/1) ... [2024-10-14 07:42:10,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7baace64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:10, skipping insertion in model container [2024-10-14 07:42:10,351 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:42:10" (1/1) ... [2024-10-14 07:42:10,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:42:10,498 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i[917,930] [2024-10-14 07:42:10,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:42:10,544 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:42:10,553 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i[917,930] [2024-10-14 07:42:10,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:42:10,590 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:42:10,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:10 WrapperNode [2024-10-14 07:42:10,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:42:10,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:42:10,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:42:10,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:42:10,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:10" (1/1) ... [2024-10-14 07:42:10,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:10" (1/1) ... [2024-10-14 07:42:10,645 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-10-14 07:42:10,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:42:10,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:42:10,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:42:10,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:42:10,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:10" (1/1) ... [2024-10-14 07:42:10,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:10" (1/1) ... [2024-10-14 07:42:10,663 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:10" (1/1) ... [2024-10-14 07:42:10,682 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:42:10,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:10" (1/1) ... [2024-10-14 07:42:10,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:10" (1/1) ... [2024-10-14 07:42:10,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:10" (1/1) ... [2024-10-14 07:42:10,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:10" (1/1) ... [2024-10-14 07:42:10,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:10" (1/1) ... [2024-10-14 07:42:10,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:10" (1/1) ... [2024-10-14 07:42:10,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:42:10,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:42:10,698 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:42:10,698 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:42:10,699 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:10" (1/1) ... [2024-10-14 07:42:10,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:42:10,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:42:10,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:42:10,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:42:10,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:42:10,777 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:42:10,777 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:42:10,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:42:10,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:42:10,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:42:10,859 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:42:10,861 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:42:11,119 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 07:42:11,119 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:42:11,158 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:42:11,159 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:42:11,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:42:11 BoogieIcfgContainer [2024-10-14 07:42:11,159 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:42:11,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:42:11,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:42:11,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:42:11,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:42:10" (1/3) ... [2024-10-14 07:42:11,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e033ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:42:11, skipping insertion in model container [2024-10-14 07:42:11,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:10" (2/3) ... [2024-10-14 07:42:11,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e033ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:42:11, skipping insertion in model container [2024-10-14 07:42:11,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:42:11" (3/3) ... [2024-10-14 07:42:11,172 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-51.i [2024-10-14 07:42:11,186 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:42:11,186 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:42:11,233 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:42:11,238 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;@5da2fa89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:42:11,239 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:42:11,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 07:42:11,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-14 07:42:11,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:42:11,254 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:42:11,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:42:11,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:42:11,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1355258684, now seen corresponding path program 1 times [2024-10-14 07:42:11,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:42:11,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648531598] [2024-10-14 07:42:11,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:42:11,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:42:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:42:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:42:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:42:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:42:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:42:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 07:42:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 07:42:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 07:42:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 07:42:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 07:42:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:42:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 07:42:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:42:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 07:42:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:42:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:42:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 07:42:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:42:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 07:42:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:42:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 07:42:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 07:42:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 07:42:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 07:42:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 07:42:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 07:42:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 07:42:11,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 07:42:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 07:42:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 07:42:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 07:42:11,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:42:11,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648531598] [2024-10-14 07:42:11,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648531598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:42:11,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:42:11,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:42:11,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288158166] [2024-10-14 07:42:11,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:42:11,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:42:11,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:42:11,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:42:11,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:42:11,839 INFO L87 Difference]: Start difference. First operand has 75 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-14 07:42:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:42:11,900 INFO L93 Difference]: Finished difference Result 147 states and 266 transitions. [2024-10-14 07:42:11,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:42:11,908 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 181 [2024-10-14 07:42:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:42:11,916 INFO L225 Difference]: With dead ends: 147 [2024-10-14 07:42:11,918 INFO L226 Difference]: Without dead ends: 73 [2024-10-14 07:42:11,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:42:11,928 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:42:11,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:42:11,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-14 07:42:11,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-14 07:42:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 07:42:11,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 114 transitions. [2024-10-14 07:42:11,985 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 114 transitions. Word has length 181 [2024-10-14 07:42:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:42:11,986 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 114 transitions. [2024-10-14 07:42:11,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-14 07:42:11,987 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 114 transitions. [2024-10-14 07:42:11,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-14 07:42:11,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:42:11,991 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:42:11,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:42:11,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:42:11,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:42:11,992 INFO L85 PathProgramCache]: Analyzing trace with hash 143607556, now seen corresponding path program 1 times [2024-10-14 07:42:11,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:42:11,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938374897] [2024-10-14 07:42:11,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:42:11,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:42:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:42:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:42:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:42:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:42:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:42:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 07:42:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 07:42:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 07:42:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 07:42:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 07:42:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:42:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 07:42:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:42:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 07:42:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:42:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:42:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 07:42:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:42:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 07:42:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:42:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 07:42:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 07:42:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 07:42:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 07:42:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 07:42:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 07:42:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 07:42:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 07:42:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 07:42:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 07:42:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 07:42:12,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:42:12,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938374897] [2024-10-14 07:42:12,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938374897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:42:12,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:42:12,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:42:12,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175244138] [2024-10-14 07:42:12,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:42:12,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:42:12,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:42:12,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:42:12,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:42:12,340 INFO L87 Difference]: Start difference. First operand 73 states and 114 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 07:42:12,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:42:12,400 INFO L93 Difference]: Finished difference Result 190 states and 294 transitions. [2024-10-14 07:42:12,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:42:12,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 181 [2024-10-14 07:42:12,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:42:12,409 INFO L225 Difference]: With dead ends: 190 [2024-10-14 07:42:12,409 INFO L226 Difference]: Without dead ends: 118 [2024-10-14 07:42:12,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:42:12,411 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 63 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:42:12,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 215 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:42:12,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-14 07:42:12,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2024-10-14 07:42:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 66 states have internal predecessors, (84), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-14 07:42:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 178 transitions. [2024-10-14 07:42:12,441 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 178 transitions. Word has length 181 [2024-10-14 07:42:12,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:42:12,443 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 178 transitions. [2024-10-14 07:42:12,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 07:42:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 178 transitions. [2024-10-14 07:42:12,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-14 07:42:12,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:42:12,448 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:42:12,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:42:12,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:42:12,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:42:12,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1427922676, now seen corresponding path program 1 times [2024-10-14 07:42:12,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:42:12,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892055858] [2024-10-14 07:42:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:42:12,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:42:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:42:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:42:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:42:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:42:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:42:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 07:42:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 07:42:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 07:42:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 07:42:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 07:42:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:42:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 07:42:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:42:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 07:42:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:42:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:42:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 07:42:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:42:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 07:42:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:42:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 07:42:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 07:42:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 07:42:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-14 07:42:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 07:42:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 07:42:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 07:42:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 07:42:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 07:42:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 07:42:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:12,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-14 07:42:12,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:42:12,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892055858] [2024-10-14 07:42:12,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892055858] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:42:12,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253809881] [2024-10-14 07:42:12,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:42:12,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:42:12,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:42:12,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:42:12,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 07:42:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:13,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 07:42:13,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:42:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-14 07:42:13,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:42:13,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-14 07:42:13,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253809881] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:42:13,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 07:42:13,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-14 07:42:13,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113076882] [2024-10-14 07:42:13,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 07:42:13,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 07:42:13,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:42:13,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 07:42:13,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:42:13,673 INFO L87 Difference]: Start difference. First operand 115 states and 178 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) [2024-10-14 07:42:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:42:13,924 INFO L93 Difference]: Finished difference Result 241 states and 365 transitions. [2024-10-14 07:42:13,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 07:42:13,925 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) Word has length 182 [2024-10-14 07:42:13,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:42:13,929 INFO L225 Difference]: With dead ends: 241 [2024-10-14 07:42:13,929 INFO L226 Difference]: Without dead ends: 127 [2024-10-14 07:42:13,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-14 07:42:13,931 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 119 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:42:13,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 158 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:42:13,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-14 07:42:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2024-10-14 07:42:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 72 states have internal predecessors, (88), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-14 07:42:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 182 transitions. [2024-10-14 07:42:13,951 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 182 transitions. Word has length 182 [2024-10-14 07:42:13,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:42:13,951 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 182 transitions. [2024-10-14 07:42:13,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) [2024-10-14 07:42:13,952 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 182 transitions. [2024-10-14 07:42:13,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-14 07:42:13,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:42:13,954 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:42:13,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 07:42:14,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:42:14,159 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:42:14,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:42:14,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2107981046, now seen corresponding path program 1 times [2024-10-14 07:42:14,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:42:14,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435907980] [2024-10-14 07:42:14,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:42:14,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:42:14,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:42:14,229 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:42:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:42:14,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:42:14,326 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:42:14,327 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:42:14,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:42:14,331 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 07:42:14,404 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:42:14,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:42:14 BoogieIcfgContainer [2024-10-14 07:42:14,408 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:42:14,409 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:42:14,409 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:42:14,409 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:42:14,409 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:42:11" (3/4) ... [2024-10-14 07:42:14,411 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:42:14,412 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:42:14,412 INFO L158 Benchmark]: Toolchain (without parser) took 4069.54ms. Allocated memory was 148.9MB in the beginning and 207.6MB in the end (delta: 58.7MB). Free memory was 94.2MB in the beginning and 79.2MB in the end (delta: 15.0MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2024-10-14 07:42:14,413 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 107.0MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:42:14,413 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.85ms. Allocated memory is still 148.9MB. Free memory was 94.2MB in the beginning and 79.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 07:42:14,413 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.04ms. Allocated memory is still 148.9MB. Free memory was 79.5MB in the beginning and 76.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 07:42:14,414 INFO L158 Benchmark]: Boogie Preprocessor took 46.35ms. Allocated memory is still 148.9MB. Free memory was 76.5MB in the beginning and 73.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:42:14,414 INFO L158 Benchmark]: RCFGBuilder took 461.62ms. Allocated memory is still 148.9MB. Free memory was 73.0MB in the beginning and 48.7MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 07:42:14,414 INFO L158 Benchmark]: TraceAbstraction took 3247.16ms. Allocated memory was 148.9MB in the beginning and 207.6MB in the end (delta: 58.7MB). Free memory was 48.0MB in the beginning and 79.2MB in the end (delta: -31.1MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2024-10-14 07:42:14,414 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 207.6MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:42:14,416 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 107.0MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.85ms. Allocated memory is still 148.9MB. Free memory was 94.2MB in the beginning and 79.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.04ms. Allocated memory is still 148.9MB. Free memory was 79.5MB in the beginning and 76.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.35ms. Allocated memory is still 148.9MB. Free memory was 76.5MB in the beginning and 73.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 461.62ms. Allocated memory is still 148.9MB. Free memory was 73.0MB in the beginning and 48.7MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3247.16ms. Allocated memory was 148.9MB in the beginning and 207.6MB in the end (delta: 58.7MB). Free memory was 48.0MB in the beginning and 79.2MB in the end (delta: -31.1MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 207.6MB. Free memory is still 79.2MB. 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 someBinaryDOUBLEComparisonOperation at line 152, overapproximation of someUnaryDOUBLEoperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] unsigned long int var_1_2 = 32; [L24] unsigned long int var_1_3 = 128; [L25] double var_1_4 = 32.3; [L26] double var_1_5 = 0.25; [L27] double var_1_6 = 500.6; [L28] unsigned char var_1_7 = 2; [L29] signed char var_1_8 = -10; [L30] signed char var_1_9 = 5; [L31] signed char var_1_10 = 4; [L32] signed char var_1_11 = 100; [L33] unsigned long int var_1_12 = 8; [L34] unsigned char var_1_13 = 0; [L35] unsigned char var_1_14 = 1; [L36] unsigned long int var_1_15 = 1114432789; [L37] unsigned long int var_1_16 = 2; [L38] double var_1_17 = 256.8; [L39] double var_1_18 = 1.25; [L40] unsigned long int var_1_19 = 16; [L41] unsigned char var_1_21 = 1; [L42] double var_1_22 = -0.5; [L43] unsigned char var_1_23 = 0; [L44] unsigned char var_1_24 = 1; [L156] isInitial = 1 [L157] FCALL initially() [L158] COND TRUE 1 [L159] FCALL updateLastVariables() [L160] CALL updateVariables() [L101] var_1_2 = __VERIFIER_nondet_ulong() [L102] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L102] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L103] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L103] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L104] var_1_3 = __VERIFIER_nondet_ulong() [L105] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L105] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L106] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L106] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L107] var_1_4 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L108] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L109] var_1_5 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L110] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L111] var_1_6 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L112] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L113] var_1_7 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L114] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L115] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=5] [L115] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=5] [L116] var_1_9 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L117] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L118] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L118] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L119] var_1_10 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L120] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L121] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L122] var_1_11 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L123] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L124] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L124] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L125] var_1_13 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L126] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L127] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L127] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L128] var_1_14 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L129] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L130] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L130] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L131] var_1_15 = __VERIFIER_nondet_ulong() [L132] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L132] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L133] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L133] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L134] var_1_16 = __VERIFIER_nondet_ulong() [L135] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L135] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L136] CALL assume_abort_if_not(var_1_16 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L136] RET assume_abort_if_not(var_1_16 <= 1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L137] var_1_18 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L138] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L139] var_1_22 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L140] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L141] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L142] var_1_23 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L143] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L144] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L145] var_1_24 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L146] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L147] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L147] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=0] [L160] RET updateVariables() [L161] CALL step() [L48] unsigned long int stepLocal_1 = var_1_2; [L49] unsigned long int stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=-4294967263, stepLocal_1=-4294967263, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=-4294967263, var_1_7=-2, var_1_8=-10, var_1_9=0] [L50] COND FALSE !(32u >= stepLocal_0) [L57] var_1_1 = var_1_7 VAL [isInitial=1, stepLocal_1=-4294967263, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=-2, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=-4294967263, var_1_7=-2, var_1_8=-10, var_1_9=0] [L59] COND TRUE ! (var_1_6 > var_1_5) [L60] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, stepLocal_1=-4294967263, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=-2, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=-4294967263, var_1_7=-2, var_1_8=-1, var_1_9=0] [L64] unsigned char stepLocal_2 = var_1_13; VAL [isInitial=1, stepLocal_1=-4294967263, stepLocal_2=-255, var_1_10=0, var_1_11=1, var_1_12=8, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=-2, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=-4294967263, var_1_7=-2, var_1_8=-1, var_1_9=0] [L65] COND TRUE stepLocal_2 && var_1_14 [L66] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_1=-4294967263, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=-2, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=-4294967263, var_1_7=-2, var_1_8=-1, var_1_9=0] [L72] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, stepLocal_1=-4294967263, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=-2, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=-4294967263, var_1_7=-2, var_1_8=-1, var_1_9=0] [L75] unsigned char stepLocal_3 = ((((var_1_4) > (var_1_6)) ? (var_1_4) : (var_1_6))) > var_1_18; VAL [isInitial=1, stepLocal_1=-4294967263, stepLocal_3=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=-2, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=-4294967263, var_1_7=-2, var_1_8=-1, var_1_9=0] [L76] COND TRUE var_1_14 || stepLocal_3 VAL [isInitial=1, stepLocal_1=-4294967263, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=16, var_1_1=-2, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=-4294967263, var_1_7=-2, var_1_8=-1, var_1_9=0] [L77] COND TRUE var_1_18 > ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) [L78] var_1_19 = var_1_16 VAL [isInitial=1, stepLocal_1=-4294967263, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=1, var_1_1=-2, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=-4294967263, var_1_7=-2, var_1_8=-1, var_1_9=0] [L85] unsigned long int stepLocal_4 = var_1_3; VAL [isInitial=1, stepLocal_1=-4294967263, stepLocal_4=34, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=1, var_1_1=-2, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=-4294967263, var_1_3=34, var_1_7=-2, var_1_8=-1, var_1_9=0] [L86] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L97] var_1_21 = var_1_23 VAL [isInitial=1, stepLocal_1=-4294967263, stepLocal_4=34, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=1, var_1_1=-2, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_2=-4294967263, var_1_3=34, var_1_7=-2, var_1_8=-1, var_1_9=0] [L161] RET step() [L162] CALL, EXPR property() [L152-L153] return ((((((32u >= var_1_2) ? ((var_1_2 <= var_1_3) ? (((var_1_4 - var_1_5) >= var_1_6) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_6 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_13 && var_1_14) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_13 ? (var_1_12 == ((unsigned long int) (((((var_1_1) > ((var_1_11 + var_1_7))) ? (var_1_1) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_16)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((var_1_14 || (((((var_1_4) > (var_1_6)) ? (var_1_4) : (var_1_6))) > var_1_18)) ? ((var_1_18 > ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) ? (var_1_19 == ((unsigned long int) var_1_16)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) var_1_16)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_2 < var_1_3) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; [L162] RET, EXPR property() [L162] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=1, var_1_1=-2, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_2=-4294967263, var_1_3=34, var_1_7=-2, var_1_8=-1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1, var_1_13=-255, var_1_14=1, var_1_15=-2147483649, var_1_16=1, var_1_17=1284/5, var_1_19=1, var_1_1=-2, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_2=-4294967263, var_1_3=34, var_1_7=-2, var_1_8=-1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 4, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 182 mSDsluCounter, 484 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 190 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 294 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 584 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=3, InterpolantAutomatonStates: 13, 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, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 908 NumberOfCodeBlocks, 908 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 903 ConstructedInterpolants, 0 QuantifiedInterpolants, 1338 SizeOfPredicates, 3 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 8556/8700 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 07:42:14,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.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 91502c696c3817feb6a83b9fc9ac9f8d3ae7404690c12bcf1fe920d76454d132 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:42:16,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:42:16,689 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 07:42:16,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:42:16,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:42:16,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:42:16,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:42:16,733 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:42:16,734 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:42:16,735 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:42:16,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:42:16,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:42:16,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:42:16,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:42:16,738 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:42:16,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:42:16,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:42:16,739 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:42:16,739 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:42:16,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:42:16,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:42:16,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:42:16,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:42:16,743 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:42:16,744 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:42:16,744 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:42:16,744 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:42:16,744 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:42:16,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:42:16,745 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:42:16,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:42:16,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:42:16,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:42:16,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:42:16,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:42:16,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:42:16,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:42:16,746 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:42:16,746 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:42:16,746 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:42:16,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:42:16,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:42:16,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:42:16,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:42:16,749 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:42:16,749 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 -> 91502c696c3817feb6a83b9fc9ac9f8d3ae7404690c12bcf1fe920d76454d132 [2024-10-14 07:42:17,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:42:17,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:42:17,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:42:17,080 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:42:17,080 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:42:17,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i [2024-10-14 07:42:18,528 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:42:18,707 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:42:18,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i [2024-10-14 07:42:18,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c960527de/346f530eaf1c4085bd85dcc20257c252/FLAG3b4e34c89 [2024-10-14 07:42:19,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c960527de/346f530eaf1c4085bd85dcc20257c252 [2024-10-14 07:42:19,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:42:19,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:42:19,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:42:19,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:42:19,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:42:19,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:42:19" (1/1) ... [2024-10-14 07:42:19,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb6ca3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:19, skipping insertion in model container [2024-10-14 07:42:19,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:42:19" (1/1) ... [2024-10-14 07:42:19,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:42:19,275 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i[917,930] [2024-10-14 07:42:19,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:42:19,382 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:42:19,393 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-51.i[917,930] [2024-10-14 07:42:19,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:42:19,444 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:42:19,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:19 WrapperNode [2024-10-14 07:42:19,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:42:19,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:42:19,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:42:19,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:42:19,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:19" (1/1) ... [2024-10-14 07:42:19,468 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:19" (1/1) ... [2024-10-14 07:42:19,501 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-10-14 07:42:19,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:42:19,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:42:19,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:42:19,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:42:19,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:19" (1/1) ... [2024-10-14 07:42:19,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:19" (1/1) ... [2024-10-14 07:42:19,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:19" (1/1) ... [2024-10-14 07:42:19,542 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:42:19,543 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:19" (1/1) ... [2024-10-14 07:42:19,543 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:19" (1/1) ... [2024-10-14 07:42:19,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:19" (1/1) ... [2024-10-14 07:42:19,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:19" (1/1) ... [2024-10-14 07:42:19,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:19" (1/1) ... [2024-10-14 07:42:19,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:19" (1/1) ... [2024-10-14 07:42:19,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:42:19,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:42:19,580 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:42:19,580 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:42:19,581 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:19" (1/1) ... [2024-10-14 07:42:19,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:42:19,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:42:19,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:42:19,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:42:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:42:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:42:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:42:19,652 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:42:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:42:19,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:42:19,722 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:42:19,724 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:42:29,457 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 07:42:29,458 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:42:29,487 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:42:29,488 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:42:29,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:42:29 BoogieIcfgContainer [2024-10-14 07:42:29,488 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:42:29,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:42:29,490 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:42:29,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:42:29,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:42:19" (1/3) ... [2024-10-14 07:42:29,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a0affd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:42:29, skipping insertion in model container [2024-10-14 07:42:29,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:42:19" (2/3) ... [2024-10-14 07:42:29,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a0affd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:42:29, skipping insertion in model container [2024-10-14 07:42:29,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:42:29" (3/3) ... [2024-10-14 07:42:29,495 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-51.i [2024-10-14 07:42:29,511 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:42:29,512 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:42:29,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:42:29,575 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;@717d9f4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:42:29,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:42:29,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 07:42:29,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-14 07:42:29,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:42:29,597 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:42:29,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:42:29,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:42:29,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1355258684, now seen corresponding path program 1 times [2024-10-14 07:42:29,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:42:29,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447254601] [2024-10-14 07:42:29,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:42:29,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:42:29,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:42:29,623 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:42:29,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 07:42:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:30,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 07:42:30,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:42:30,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 778 proven. 0 refuted. 0 times theorem prover too weak. 962 trivial. 0 not checked. [2024-10-14 07:42:30,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:42:30,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:42:30,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447254601] [2024-10-14 07:42:30,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447254601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:42:30,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:42:30,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:42:30,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281037022] [2024-10-14 07:42:30,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:42:30,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:42:30,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:42:30,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:42:30,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:42:30,560 INFO L87 Difference]: Start difference. First operand has 75 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 43 states have internal predecessors, (59), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-14 07:42:34,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:42:34,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:42:34,852 INFO L93 Difference]: Finished difference Result 147 states and 266 transitions. [2024-10-14 07:42:34,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:42:34,938 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 181 [2024-10-14 07:42:34,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:42:34,944 INFO L225 Difference]: With dead ends: 147 [2024-10-14 07:42:34,945 INFO L226 Difference]: Without dead ends: 73 [2024-10-14 07:42:34,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:42:34,957 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:42:34,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 07:42:34,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-14 07:42:35,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-14 07:42:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 07:42:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 114 transitions. [2024-10-14 07:42:35,012 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 114 transitions. Word has length 181 [2024-10-14 07:42:35,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:42:35,012 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 114 transitions. [2024-10-14 07:42:35,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-14 07:42:35,013 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 114 transitions. [2024-10-14 07:42:35,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-14 07:42:35,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:42:35,019 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:42:35,041 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-10-14 07:42:35,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:42:35,221 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:42:35,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:42:35,221 INFO L85 PathProgramCache]: Analyzing trace with hash 143607556, now seen corresponding path program 1 times [2024-10-14 07:42:35,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:42:35,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284802462] [2024-10-14 07:42:35,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:42:35,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:42:35,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:42:35,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:42:35,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 07:42:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:35,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 07:42:35,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:42:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-14 07:42:38,322 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:42:38,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:42:38,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284802462] [2024-10-14 07:42:38,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284802462] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:42:38,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [913243038] [2024-10-14 07:42:38,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:42:38,752 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 07:42:38,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 07:42:38,755 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 07:42:38,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-14 07:42:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:38,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 07:42:38,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:42:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-14 07:42:39,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:42:39,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [913243038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:42:39,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 07:42:39,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-14 07:42:39,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988998437] [2024-10-14 07:42:39,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:42:39,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:42:39,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:42:39,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:42:39,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:42:39,084 INFO L87 Difference]: Start difference. First operand 73 states and 114 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 07:42:43,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:42:47,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:42:51,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:42:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:42:51,561 INFO L93 Difference]: Finished difference Result 190 states and 294 transitions. [2024-10-14 07:42:51,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:42:51,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 181 [2024-10-14 07:42:51,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:42:51,563 INFO L225 Difference]: With dead ends: 190 [2024-10-14 07:42:51,564 INFO L226 Difference]: Without dead ends: 118 [2024-10-14 07:42:51,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:42:51,565 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 63 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-10-14 07:42:51,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 214 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2024-10-14 07:42:51,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-14 07:42:51,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2024-10-14 07:42:51,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 66 states have internal predecessors, (84), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-14 07:42:51,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 178 transitions. [2024-10-14 07:42:51,580 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 178 transitions. Word has length 181 [2024-10-14 07:42:51,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:42:51,581 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 178 transitions. [2024-10-14 07:42:51,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-14 07:42:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 178 transitions. [2024-10-14 07:42:51,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-14 07:42:51,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:42:51,583 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:42:51,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-10-14 07:42:51,812 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-10-14 07:42:51,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt,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-10-14 07:42:51,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:42:51,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:42:51,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1427922676, now seen corresponding path program 1 times [2024-10-14 07:42:51,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:42:51,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642891441] [2024-10-14 07:42:51,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:42:51,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:42:51,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:42:51,996 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-10-14 07:42:51,998 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-10-14 07:42:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:52,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 07:42:52,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:42:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-14 07:42:55,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:42:55,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:42:55,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642891441] [2024-10-14 07:42:55,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642891441] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:42:55,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [771990013] [2024-10-14 07:42:55,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:42:55,604 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 07:42:55,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 07:42:55,605 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 07:42:55,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-14 07:42:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:56,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-10-14 07:42:56,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:43:04,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-14 07:43:04,495 INFO L311 TraceCheckSpWp]: Computing backward predicates...