./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_fillercode_fillercodestructure_filler-pe-ci_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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_fillercode_fillercodestructure_filler-pe-ci_file-89.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 d508bfe07e46a5994b51c19cb60c0106876ffe70f0bb1d3682fc3cc1a96831c2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:00:30,017 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:00:30,078 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 07:00:30,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:00:30,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:00:30,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:00:30,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:00:30,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:00:30,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:00:30,105 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:00:30,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:00:30,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:00:30,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:00:30,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:00:30,107 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:00:30,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:00:30,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:00:30,110 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:00:30,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 07:00:30,112 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:00:30,112 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:00:30,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:00:30,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:00:30,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:00:30,114 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:00:30,114 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:00:30,114 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:00:30,114 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:00:30,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:00:30,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:00:30,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:00:30,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:00:30,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:00:30,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:00:30,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:00:30,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:00:30,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 07:00:30,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 07:00:30,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:00:30,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:00:30,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:00:30,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:00:30,118 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 -> d508bfe07e46a5994b51c19cb60c0106876ffe70f0bb1d3682fc3cc1a96831c2 [2024-10-24 07:00:30,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:00:30,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:00:30,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:00:30,358 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:00:30,362 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:00:30,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-89.i [2024-10-24 07:00:31,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:00:31,740 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:00:31,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-89.i [2024-10-24 07:00:31,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f1bd4fc3/07514113c75b4068bf6d7908b293846d/FLAG9cea36c76 [2024-10-24 07:00:31,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f1bd4fc3/07514113c75b4068bf6d7908b293846d [2024-10-24 07:00:31,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:00:31,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:00:31,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:00:31,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:00:31,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:00:31,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:00:31" (1/1) ... [2024-10-24 07:00:31,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e48df82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:31, skipping insertion in model container [2024-10-24 07:00:31,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:00:31" (1/1) ... [2024-10-24 07:00:31,805 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:00:31,936 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_fillercode_fillercodestructure_filler-pe-ci_file-89.i[919,932] [2024-10-24 07:00:31,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:00:32,001 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:00:32,011 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_fillercode_fillercodestructure_filler-pe-ci_file-89.i[919,932] [2024-10-24 07:00:32,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:00:32,053 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:00:32,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:32 WrapperNode [2024-10-24 07:00:32,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:00:32,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:00:32,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:00:32,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:00:32,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:32" (1/1) ... [2024-10-24 07:00:32,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:32" (1/1) ... [2024-10-24 07:00:32,133 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-10-24 07:00:32,134 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:00:32,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:00:32,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:00:32,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:00:32,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:32" (1/1) ... [2024-10-24 07:00:32,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:32" (1/1) ... [2024-10-24 07:00:32,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:32" (1/1) ... [2024-10-24 07:00:32,196 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-24 07:00:32,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:32" (1/1) ... [2024-10-24 07:00:32,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:32" (1/1) ... [2024-10-24 07:00:32,208 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:32" (1/1) ... [2024-10-24 07:00:32,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:32" (1/1) ... [2024-10-24 07:00:32,214 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:32" (1/1) ... [2024-10-24 07:00:32,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:32" (1/1) ... [2024-10-24 07:00:32,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:00:32,224 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:00:32,224 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:00:32,225 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:00:32,225 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:32" (1/1) ... [2024-10-24 07:00:32,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:00:32,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:00:32,254 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-24 07:00:32,257 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-24 07:00:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:00:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:00:32,298 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:00:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 07:00:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:00:32,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:00:32,382 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:00:32,384 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:00:32,755 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 07:00:32,755 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:00:32,795 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:00:32,796 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:00:32,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:00:32 BoogieIcfgContainer [2024-10-24 07:00:32,797 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:00:32,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:00:32,799 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:00:32,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:00:32,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:00:31" (1/3) ... [2024-10-24 07:00:32,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536b41b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:00:32, skipping insertion in model container [2024-10-24 07:00:32,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:32" (2/3) ... [2024-10-24 07:00:32,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536b41b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:00:32, skipping insertion in model container [2024-10-24 07:00:32,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:00:32" (3/3) ... [2024-10-24 07:00:32,804 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-89.i [2024-10-24 07:00:32,818 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:00:32,818 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:00:32,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:00:32,879 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;@58b45dfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:00:32,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:00:32,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 53 states have internal predecessors, (85), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 07:00:32,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 07:00:32,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:00:32,894 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:00:32,894 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:00:32,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:00:32,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1096693466, now seen corresponding path program 1 times [2024-10-24 07:00:32,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:00:32,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695796251] [2024-10-24 07:00:32,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:00:32,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:00:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:00:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:00:33,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:00:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:00:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:00:33,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:00:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:00:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:00:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 07:00:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:00:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 07:00:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:00:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 07:00:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:00:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:00:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 07:00:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:00:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:00:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:00:33,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 07:00:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,310 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 07:00:33,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:00:33,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695796251] [2024-10-24 07:00:33,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695796251] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:00:33,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:00:33,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:00:33,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001674025] [2024-10-24 07:00:33,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:00:33,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:00:33,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:00:33,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:00:33,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:00:33,344 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 53 states have internal predecessors, (85), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 07:00:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:00:33,384 INFO L93 Difference]: Finished difference Result 147 states and 268 transitions. [2024-10-24 07:00:33,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:00:33,387 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2024-10-24 07:00:33,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:00:33,394 INFO L225 Difference]: With dead ends: 147 [2024-10-24 07:00:33,395 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 07:00:33,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-24 07:00:33,404 INFO L432 NwaCegarLoop]: 117 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, 117 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-24 07:00:33,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:00:33,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 07:00:33,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-24 07:00:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 51 states have internal predecessors, (80), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 07:00:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2024-10-24 07:00:33,453 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 120 transitions. Word has length 132 [2024-10-24 07:00:33,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:00:33,454 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 120 transitions. [2024-10-24 07:00:33,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 07:00:33,455 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 120 transitions. [2024-10-24 07:00:33,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 07:00:33,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:00:33,459 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:00:33,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 07:00:33,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:00:33,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:00:33,461 INFO L85 PathProgramCache]: Analyzing trace with hash 135190054, now seen corresponding path program 1 times [2024-10-24 07:00:33,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:00:33,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310447212] [2024-10-24 07:00:33,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:00:33,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:00:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:00:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:00:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:00:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:00:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:00:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:00:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:00:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:00:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 07:00:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:00:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 07:00:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:00:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 07:00:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:00:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:00:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 07:00:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:00:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:00:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:00:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 07:00:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,669 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 07:00:33,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:00:33,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310447212] [2024-10-24 07:00:33,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310447212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:00:33,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:00:33,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:00:33,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554247151] [2024-10-24 07:00:33,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:00:33,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:00:33,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:00:33,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:00:33,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:00:33,673 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 07:00:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:00:33,754 INFO L93 Difference]: Finished difference Result 212 states and 348 transitions. [2024-10-24 07:00:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:00:33,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-10-24 07:00:33,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:00:33,757 INFO L225 Difference]: With dead ends: 212 [2024-10-24 07:00:33,757 INFO L226 Difference]: Without dead ends: 140 [2024-10-24 07:00:33,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-24 07:00:33,759 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 104 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:00:33,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 212 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 07:00:33,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-24 07:00:33,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2024-10-24 07:00:33,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 93 states have internal predecessors, (139), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 07:00:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 219 transitions. [2024-10-24 07:00:33,779 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 219 transitions. Word has length 132 [2024-10-24 07:00:33,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:00:33,780 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 219 transitions. [2024-10-24 07:00:33,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 07:00:33,780 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 219 transitions. [2024-10-24 07:00:33,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 07:00:33,782 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:00:33,782 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:00:33,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 07:00:33,782 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:00:33,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:00:33,783 INFO L85 PathProgramCache]: Analyzing trace with hash -449768918, now seen corresponding path program 1 times [2024-10-24 07:00:33,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:00:33,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039183661] [2024-10-24 07:00:33,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:00:33,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:00:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:00:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:00:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:00:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:00:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:00:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:00:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:00:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:00:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 07:00:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:00:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 07:00:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:00:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 07:00:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:00:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:00:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 07:00:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:00:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:00:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:00:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 07:00:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 07:00:33,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:00:33,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039183661] [2024-10-24 07:00:33,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039183661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:00:33,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:00:33,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:00:33,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563439891] [2024-10-24 07:00:33,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:00:33,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:00:33,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:00:33,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:00:33,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:00:33,972 INFO L87 Difference]: Start difference. First operand 136 states and 219 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 07:00:34,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:00:34,030 INFO L93 Difference]: Finished difference Result 305 states and 489 transitions. [2024-10-24 07:00:34,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:00:34,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-10-24 07:00:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:00:34,035 INFO L225 Difference]: With dead ends: 305 [2024-10-24 07:00:34,035 INFO L226 Difference]: Without dead ends: 170 [2024-10-24 07:00:34,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-24 07:00:34,038 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 39 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:00:34,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 254 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:00:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-24 07:00:34,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 151. [2024-10-24 07:00:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 108 states have (on average 1.5) internal successors, (162), 108 states have internal predecessors, (162), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 07:00:34,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 242 transitions. [2024-10-24 07:00:34,058 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 242 transitions. Word has length 132 [2024-10-24 07:00:34,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:00:34,061 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 242 transitions. [2024-10-24 07:00:34,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 07:00:34,061 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 242 transitions. [2024-10-24 07:00:34,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 07:00:34,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:00:34,063 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:00:34,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 07:00:34,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:00:34,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:00:34,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1259115544, now seen corresponding path program 1 times [2024-10-24 07:00:34,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:00:34,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959333810] [2024-10-24 07:00:34,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:00:34,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:00:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:00:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:00:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:00:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:00:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:00:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:00:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:00:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:00:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 07:00:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:00:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 07:00:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:00:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 07:00:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:00:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:00:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 07:00:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:00:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:00:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:00:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 07:00:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:34,763 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 07:00:34,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:00:34,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959333810] [2024-10-24 07:00:34,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959333810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:00:34,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:00:34,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 07:00:34,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743787120] [2024-10-24 07:00:34,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:00:34,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:00:34,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:00:34,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:00:34,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:00:34,767 INFO L87 Difference]: Start difference. First operand 151 states and 242 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 07:00:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:00:35,348 INFO L93 Difference]: Finished difference Result 620 states and 993 transitions. [2024-10-24 07:00:35,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 07:00:35,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-10-24 07:00:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:00:35,352 INFO L225 Difference]: With dead ends: 620 [2024-10-24 07:00:35,352 INFO L226 Difference]: Without dead ends: 470 [2024-10-24 07:00:35,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:00:35,354 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 235 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 07:00:35,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 419 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 07:00:35,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-10-24 07:00:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 306. [2024-10-24 07:00:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 221 states have (on average 1.48868778280543) internal successors, (329), 221 states have internal predecessors, (329), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 07:00:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 489 transitions. [2024-10-24 07:00:35,388 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 489 transitions. Word has length 132 [2024-10-24 07:00:35,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:00:35,389 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 489 transitions. [2024-10-24 07:00:35,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 07:00:35,389 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 489 transitions. [2024-10-24 07:00:35,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 07:00:35,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:00:35,391 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:00:35,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 07:00:35,391 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:00:35,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:00:35,391 INFO L85 PathProgramCache]: Analyzing trace with hash 839280993, now seen corresponding path program 1 times [2024-10-24 07:00:35,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:00:35,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226170145] [2024-10-24 07:00:35,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:00:35,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:00:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:00:35,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:00:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 07:00:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:00:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:00:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:00:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:00:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:00:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 07:00:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 07:00:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 07:00:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 07:00:35,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 07:00:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 07:00:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 07:00:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 07:00:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 07:00:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 07:00:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 07:00:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 07:00:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 07:00:35,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:00:35,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226170145] [2024-10-24 07:00:35,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226170145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:00:35,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:00:35,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 07:00:35,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466709111] [2024-10-24 07:00:35,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:00:35,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 07:00:35,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:00:35,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 07:00:35,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:00:35,745 INFO L87 Difference]: Start difference. First operand 306 states and 489 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 07:00:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:00:35,973 INFO L93 Difference]: Finished difference Result 600 states and 960 transitions. [2024-10-24 07:00:35,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:00:35,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-10-24 07:00:35,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:00:35,976 INFO L225 Difference]: With dead ends: 600 [2024-10-24 07:00:35,978 INFO L226 Difference]: Without dead ends: 295 [2024-10-24 07:00:35,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 07:00:35,979 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 187 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:00:35,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 353 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:00:35,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-24 07:00:36,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 283. [2024-10-24 07:00:36,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 198 states have (on average 1.4646464646464648) internal successors, (290), 198 states have internal predecessors, (290), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 07:00:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 450 transitions. [2024-10-24 07:00:36,029 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 450 transitions. Word has length 133 [2024-10-24 07:00:36,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:00:36,029 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 450 transitions. [2024-10-24 07:00:36,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 07:00:36,030 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 450 transitions. [2024-10-24 07:00:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 07:00:36,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:00:36,031 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:00:36,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 07:00:36,031 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:00:36,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:00:36,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1454382044, now seen corresponding path program 1 times [2024-10-24 07:00:36,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:00:36,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137109186] [2024-10-24 07:00:36,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:00:36,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:00:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 07:00:36,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1803073488] [2024-10-24 07:00:36,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:00:36,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:00:36,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:00:36,093 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-24 07:00:36,095 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-24 07:00:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:00:36,187 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 07:00:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 07:00:36,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 07:00:36,283 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 07:00:36,284 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 07:00:36,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 07:00:36,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 07:00:36,488 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 07:00:36,575 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 07:00:36,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 07:00:36 BoogieIcfgContainer [2024-10-24 07:00:36,581 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 07:00:36,582 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 07:00:36,582 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 07:00:36,582 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 07:00:36,582 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:00:32" (3/4) ... [2024-10-24 07:00:36,585 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 07:00:36,586 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 07:00:36,587 INFO L158 Benchmark]: Toolchain (without parser) took 4816.62ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 106.0MB in the beginning and 134.4MB in the end (delta: -28.4MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-10-24 07:00:36,587 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory was 131.9MB in the beginning and 131.8MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:00:36,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.07ms. Allocated memory is still 176.2MB. Free memory was 105.8MB in the beginning and 88.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 07:00:36,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.60ms. Allocated memory is still 176.2MB. Free memory was 88.6MB in the beginning and 144.0MB in the end (delta: -55.4MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-10-24 07:00:36,588 INFO L158 Benchmark]: Boogie Preprocessor took 74.45ms. Allocated memory is still 176.2MB. Free memory was 144.0MB in the beginning and 137.7MB in the end (delta: 6.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 07:00:36,588 INFO L158 Benchmark]: RCFGBuilder took 573.47ms. Allocated memory is still 176.2MB. Free memory was 137.7MB in the beginning and 105.5MB in the end (delta: 32.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-24 07:00:36,589 INFO L158 Benchmark]: TraceAbstraction took 3782.60ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 104.9MB in the beginning and 134.4MB in the end (delta: -29.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-24 07:00:36,589 INFO L158 Benchmark]: Witness Printer took 4.95ms. Allocated memory is still 232.8MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 07:00:36,590 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.10ms. Allocated memory is still 176.2MB. Free memory was 131.9MB in the beginning and 131.8MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.07ms. Allocated memory is still 176.2MB. Free memory was 105.8MB in the beginning and 88.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.60ms. Allocated memory is still 176.2MB. Free memory was 88.6MB in the beginning and 144.0MB in the end (delta: -55.4MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.45ms. Allocated memory is still 176.2MB. Free memory was 144.0MB in the beginning and 137.7MB in the end (delta: 6.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 573.47ms. Allocated memory is still 176.2MB. Free memory was 137.7MB in the beginning and 105.5MB in the end (delta: 32.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3782.60ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 104.9MB in the beginning and 134.4MB in the end (delta: -29.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Witness Printer took 4.95ms. Allocated memory is still 232.8MB. Free memory is still 134.4MB. 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 184, overapproximation of someBinaryFLOATComparisonOperation at line 176. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] unsigned char var_1_4 = 0; [L24] unsigned short int var_1_8 = 32; [L25] signed long int var_1_9 = -16; [L26] unsigned short int var_1_10 = 5; [L27] unsigned char var_1_12 = 32; [L28] unsigned char var_1_13 = 1; [L29] unsigned char var_1_14 = 0; [L30] unsigned char var_1_15 = 0; [L31] double var_1_16 = 63.75; [L32] double var_1_17 = 8.5; [L33] signed short int var_1_18 = -64; [L34] unsigned char var_1_19 = 32; [L35] signed short int var_1_24 = -1; [L36] signed short int var_1_25 = 2; [L37] unsigned char var_1_26 = 100; [L38] unsigned char var_1_29 = 128; [L39] unsigned char var_1_30 = 64; [L40] signed char var_1_31 = -1; [L41] unsigned short int var_1_32 = 100; [L42] unsigned long int var_1_33 = 0; [L43] float var_1_36 = 16.8; [L44] signed char var_1_38 = 0; [L45] signed long int var_1_39 = -4; [L46] unsigned short int var_1_40 = 256; [L47] signed long int last_1_var_1_1 = 32; [L48] unsigned char last_1_var_1_12 = 32; [L49] signed short int last_1_var_1_18 = -64; [L188] isInitial = 1 [L189] FCALL initially() [L190] COND TRUE 1 [L191] CALL updateLastVariables() [L179] last_1_var_1_1 = var_1_1 [L180] last_1_var_1_12 = var_1_12 [L181] last_1_var_1_18 = var_1_18 [L191] RET updateLastVariables() [L192] CALL updateVariables() [L147] var_1_4 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_8=32, var_1_9=-16] [L148] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_8=32, var_1_9=-16] [L149] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L149] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L150] var_1_9 = __VERIFIER_nondet_long() [L151] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L151] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L152] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L152] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L153] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L153] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L154] var_1_10 = __VERIFIER_nondet_ushort() [L155] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L155] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L156] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L156] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L157] var_1_13 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L158] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L159] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L159] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L160] var_1_15 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L161] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L162] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L162] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L163] var_1_17 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L164] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L165] var_1_25 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L166] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L167] CALL assume_abort_if_not(var_1_25 <= 9) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L167] RET assume_abort_if_not(var_1_25 <= 9) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L168] var_1_29 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_29 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L169] RET assume_abort_if_not(var_1_29 >= 127) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L170] CALL assume_abort_if_not(var_1_29 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L170] RET assume_abort_if_not(var_1_29 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L171] var_1_30 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_30 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L172] RET assume_abort_if_not(var_1_30 >= 63) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L173] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L173] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L174] var_1_36 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_36 >= -922337.2036854776000e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L175] RET assume_abort_if_not((var_1_36 >= -922337.2036854776000e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L176] CALL assume_abort_if_not(var_1_36 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L176] RET assume_abort_if_not(var_1_36 != 0.0F) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L192] RET updateVariables() [L193] CALL step() [L53] signed long int stepLocal_1 = last_1_var_1_18; [L54] signed long int stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, stepLocal_1=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L55] COND FALSE !(stepLocal_1 >= (last_1_var_1_18 / var_1_9)) [L62] var_1_8 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L64] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L65] COND FALSE !(var_1_10 < var_1_18) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L76] unsigned short int stepLocal_2 = var_1_8; VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, stepLocal_2=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L77] COND FALSE !(stepLocal_2 > (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) + var_1_12)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L88] COND FALSE !(var_1_18 != var_1_12) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L93] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L100] COND FALSE !(\read(var_1_14)) [L103] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L106] EXPR var_1_12 & var_1_8 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L106] COND TRUE (var_1_12 & var_1_8) >= var_1_13 [L107] var_1_19 = var_1_13 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L109] EXPR var_1_1 >> ((((var_1_25) < (1)) ? (var_1_25) : (1))) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L109] COND FALSE !(((((var_1_12) < (25)) ? (var_1_12) : (25))) > (var_1_1 >> ((((var_1_25) < (1)) ? (var_1_25) : (1))))) [L116] COND FALSE !(var_1_15 && var_1_4) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L119] COND FALSE !(\read(var_1_4)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L124] COND FALSE !(var_1_14 && var_1_14) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L133] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L137] COND FALSE !(var_1_13 > var_1_8) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=65] [L142] var_1_38 = var_1_25 [L143] var_1_39 = var_1_30 [L144] var_1_40 = var_1_30 [L193] RET step() [L194] CALL, EXPR property() [L184-L185] return ((((((var_1_18 != var_1_12) ? (var_1_14 ? (var_1_1 == ((signed long int) ((((((((-5) > (var_1_12)) ? (-5) : (var_1_12)))) < (((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18))))) ? (((((-5) > (var_1_12)) ? (-5) : (var_1_12)))) : (((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18)))))))) : 1) : 1) && ((last_1_var_1_18 >= (last_1_var_1_18 / var_1_9)) ? ((last_1_var_1_18 < (last_1_var_1_1 * 256)) ? (var_1_8 == ((unsigned short int) ((((last_1_var_1_12) < (((((128) < (last_1_var_1_12)) ? (128) : (last_1_var_1_12))))) ? (last_1_var_1_12) : (((((128) < (last_1_var_1_12)) ? (128) : (last_1_var_1_12)))))))) : (var_1_8 == ((unsigned short int) last_1_var_1_12))) : (var_1_8 == ((unsigned short int) last_1_var_1_12)))) && ((var_1_10 < var_1_18) ? ((last_1_var_1_12 <= (5 - last_1_var_1_12)) ? (var_1_12 == ((unsigned char) var_1_13)) : ((last_1_var_1_12 == var_1_8) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) var_1_13)))) : 1)) && ((var_1_8 > (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) + var_1_12)) ? ((! (var_1_8 >= var_1_12)) ? (var_1_4 ? (var_1_14 == ((unsigned char) 0)) : (var_1_14 == ((unsigned char) var_1_15))) : (var_1_14 == ((unsigned char) var_1_15))) : 1)) && (var_1_14 ? (var_1_15 ? (var_1_16 == ((double) var_1_17)) : (var_1_16 == ((double) (((((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) > (var_1_17)) ? ((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) : (var_1_17)))))) : (var_1_14 ? (var_1_16 == ((double) 5.2)) : (var_1_16 == ((double) var_1_17))))) && (var_1_18 == ((signed short int) var_1_8)) ; [L194] RET, EXPR property() [L194] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=65] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=65] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 6, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 565 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 565 mSDsluCounter, 1355 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 674 mSDsCounter, 201 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 423 IncrementalHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 201 mSolverCounterUnsat, 681 mSDtfsCounter, 423 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 199 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 927 NumberOfCodeBlocks, 927 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 656 ConstructedInterpolants, 0 QuantifiedInterpolants, 1883 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 3800/3800 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-24 07:00:36,622 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_fillercode_fillercodestructure_filler-pe-ci_file-89.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 d508bfe07e46a5994b51c19cb60c0106876ffe70f0bb1d3682fc3cc1a96831c2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:00:38,552 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:00:38,620 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 07:00:38,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:00:38,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:00:38,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:00:38,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:00:38,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:00:38,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:00:38,662 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:00:38,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:00:38,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:00:38,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:00:38,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:00:38,663 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:00:38,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:00:38,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:00:38,667 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:00:38,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:00:38,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:00:38,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:00:38,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:00:38,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:00:38,668 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 07:00:38,668 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 07:00:38,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:00:38,669 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 07:00:38,669 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:00:38,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:00:38,669 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:00:38,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:00:38,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:00:38,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:00:38,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:00:38,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:00:38,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:00:38,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:00:38,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:00:38,670 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 07:00:38,670 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 07:00:38,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:00:38,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:00:38,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:00:38,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:00:38,672 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 07:00:38,672 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 -> d508bfe07e46a5994b51c19cb60c0106876ffe70f0bb1d3682fc3cc1a96831c2 [2024-10-24 07:00:38,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:00:38,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:00:38,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:00:38,988 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:00:38,988 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:00:38,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-89.i [2024-10-24 07:00:40,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:00:40,470 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:00:40,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-89.i [2024-10-24 07:00:40,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e025e346/68301e69e9bc48238dcfda57ad2f3fba/FLAG056e83f49 [2024-10-24 07:00:40,503 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e025e346/68301e69e9bc48238dcfda57ad2f3fba [2024-10-24 07:00:40,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:00:40,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:00:40,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:00:40,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:00:40,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:00:40,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:00:40" (1/1) ... [2024-10-24 07:00:40,515 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76be7147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:40, skipping insertion in model container [2024-10-24 07:00:40,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:00:40" (1/1) ... [2024-10-24 07:00:40,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:00:40,695 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_fillercode_fillercodestructure_filler-pe-ci_file-89.i[919,932] [2024-10-24 07:00:40,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:00:40,786 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:00:40,803 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_fillercode_fillercodestructure_filler-pe-ci_file-89.i[919,932] [2024-10-24 07:00:40,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:00:40,864 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:00:40,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:40 WrapperNode [2024-10-24 07:00:40,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:00:40,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:00:40,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:00:40,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:00:40,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:40" (1/1) ... [2024-10-24 07:00:40,888 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:40" (1/1) ... [2024-10-24 07:00:40,919 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-10-24 07:00:40,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:00:40,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:00:40,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:00:40,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:00:40,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:40" (1/1) ... [2024-10-24 07:00:40,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:40" (1/1) ... [2024-10-24 07:00:40,939 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:40" (1/1) ... [2024-10-24 07:00:40,960 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-24 07:00:40,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:40" (1/1) ... [2024-10-24 07:00:40,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:40" (1/1) ... [2024-10-24 07:00:40,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:40" (1/1) ... [2024-10-24 07:00:40,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:40" (1/1) ... [2024-10-24 07:00:40,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:40" (1/1) ... [2024-10-24 07:00:40,985 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:40" (1/1) ... [2024-10-24 07:00:40,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:00:40,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:00:40,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:00:40,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:00:40,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:40" (1/1) ... [2024-10-24 07:00:40,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:00:41,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:00:41,023 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-24 07:00:41,026 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-24 07:00:41,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:00:41,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 07:00:41,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:00:41,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:00:41,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:00:41,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:00:41,134 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:00:41,135 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:00:49,973 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 07:00:49,973 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:00:50,030 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:00:50,030 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:00:50,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:00:50 BoogieIcfgContainer [2024-10-24 07:00:50,030 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:00:50,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:00:50,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:00:50,036 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:00:50,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:00:40" (1/3) ... [2024-10-24 07:00:50,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ae0dd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:00:50, skipping insertion in model container [2024-10-24 07:00:50,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:00:40" (2/3) ... [2024-10-24 07:00:50,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ae0dd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:00:50, skipping insertion in model container [2024-10-24 07:00:50,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:00:50" (3/3) ... [2024-10-24 07:00:50,039 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-89.i [2024-10-24 07:00:50,054 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:00:50,054 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:00:50,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:00:50,122 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;@2d6c0873, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:00:50,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:00:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 48 states have internal predecessors, (77), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 07:00:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 07:00:50,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:00:50,142 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:00:50,142 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:00:50,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:00:50,147 INFO L85 PathProgramCache]: Analyzing trace with hash -353693350, now seen corresponding path program 1 times [2024-10-24 07:00:50,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:00:50,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898163369] [2024-10-24 07:00:50,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:00:50,159 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-24 07:00:50,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:00:50,160 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-24 07:00:50,161 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-24 07:00:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:50,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 07:00:50,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:00:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 07:00:50,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:00:50,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:00:50,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898163369] [2024-10-24 07:00:50,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898163369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:00:50,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:00:50,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 07:00:50,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743086962] [2024-10-24 07:00:50,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:00:50,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 07:00:50,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:00:50,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 07:00:50,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 07:00:50,730 INFO L87 Difference]: Start difference. First operand has 70 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 48 states have internal predecessors, (77), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 07:00:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:00:51,084 INFO L93 Difference]: Finished difference Result 199 states and 377 transitions. [2024-10-24 07:00:51,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 07:00:51,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2024-10-24 07:00:51,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:00:51,099 INFO L225 Difference]: With dead ends: 199 [2024-10-24 07:00:51,100 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 07:00:51,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 128 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-24 07:00:51,108 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 91 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 07:00:51,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 196 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 07:00:51,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 07:00:51,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2024-10-24 07:00:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 83 states have internal predecessors, (123), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 07:00:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 203 transitions. [2024-10-24 07:00:51,153 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 203 transitions. Word has length 130 [2024-10-24 07:00:51,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:00:51,154 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 203 transitions. [2024-10-24 07:00:51,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 07:00:51,155 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 203 transitions. [2024-10-24 07:00:51,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 07:00:51,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:00:51,161 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:00:51,170 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-24 07:00:51,365 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-24 07:00:51,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:00:51,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:00:51,367 INFO L85 PathProgramCache]: Analyzing trace with hash 349218270, now seen corresponding path program 1 times [2024-10-24 07:00:51,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:00:51,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491390273] [2024-10-24 07:00:51,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:00:51,370 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-24 07:00:51,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:00:51,371 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-24 07:00:51,372 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-24 07:00:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:51,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 07:00:51,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:00:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 399 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-10-24 07:00:53,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:00:54,826 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 07:00:54,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:00:54,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491390273] [2024-10-24 07:00:54,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491390273] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 07:00:54,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 07:00:54,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-24 07:00:54,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908272408] [2024-10-24 07:00:54,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 07:00:54,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 07:00:54,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:00:54,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 07:00:54,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 07:00:54,830 INFO L87 Difference]: Start difference. First operand 126 states and 203 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 07:00:56,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:00:56,698 INFO L93 Difference]: Finished difference Result 267 states and 419 transitions. [2024-10-24 07:00:56,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 07:00:56,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 130 [2024-10-24 07:00:56,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:00:56,711 INFO L225 Difference]: With dead ends: 267 [2024-10-24 07:00:56,711 INFO L226 Difference]: Without dead ends: 142 [2024-10-24 07:00:56,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-24 07:00:56,713 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 58 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 07:00:56,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 196 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 07:00:56,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-24 07:00:56,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 134. [2024-10-24 07:00:56,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 89 states have internal predecessors, (126), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 07:00:56,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 206 transitions. [2024-10-24 07:00:56,738 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 206 transitions. Word has length 130 [2024-10-24 07:00:56,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:00:56,738 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 206 transitions. [2024-10-24 07:00:56,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-24 07:00:56,738 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 206 transitions. [2024-10-24 07:00:56,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 07:00:56,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:00:56,740 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:00:56,750 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 (3)] Ended with exit code 0 [2024-10-24 07:00:56,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:00:56,941 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:00:56,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:00:56,942 INFO L85 PathProgramCache]: Analyzing trace with hash -460128356, now seen corresponding path program 1 times [2024-10-24 07:00:56,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:00:56,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296912287] [2024-10-24 07:00:56,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:00:56,943 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-24 07:00:56,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:00:56,945 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 07:00:56,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 07:00:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:00:57,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 07:00:57,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:01:02,337 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 07:01:02,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 07:01:02,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 07:01:02,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296912287] [2024-10-24 07:01:02,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1296912287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:01:02,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:01:02,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 07:01:02,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113851701] [2024-10-24 07:01:02,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:01:02,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 07:01:02,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 07:01:02,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 07:01:02,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 07:01:02,340 INFO L87 Difference]: Start difference. First operand 134 states and 206 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 07:01:07,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:01:12,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:01:16,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 07:01:17,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:01:17,556 INFO L93 Difference]: Finished difference Result 454 states and 695 transitions. [2024-10-24 07:01:17,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:01:17,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2024-10-24 07:01:17,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:01:17,559 INFO L225 Difference]: With dead ends: 454 [2024-10-24 07:01:17,560 INFO L226 Difference]: Without dead ends: 321 [2024-10-24 07:01:17,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 07:01:17,561 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 205 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 65 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:01:17,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 228 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 122 Invalid, 3 Unknown, 0 Unchecked, 15.0s Time] [2024-10-24 07:01:17,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-24 07:01:17,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 315. [2024-10-24 07:01:17,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 210 states have (on average 1.3666666666666667) internal successors, (287), 212 states have internal predecessors, (287), 94 states have call successors, (94), 10 states have call predecessors, (94), 10 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-24 07:01:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 475 transitions. [2024-10-24 07:01:17,611 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 475 transitions. Word has length 130 [2024-10-24 07:01:17,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:01:17,612 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 475 transitions. [2024-10-24 07:01:17,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 07:01:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 475 transitions. [2024-10-24 07:01:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 07:01:17,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:01:17,617 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 07:01:17,628 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 (4)] Ended with exit code 0 [2024-10-24 07:01:17,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 07:01:17,818 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:01:17,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:01:17,819 INFO L85 PathProgramCache]: Analyzing trace with hash -67101346, now seen corresponding path program 1 times [2024-10-24 07:01:17,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 07:01:17,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665817814] [2024-10-24 07:01:17,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:01:17,821 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-24 07:01:17,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 07:01:17,822 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-24 07:01:17,824 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-24 07:01:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:01:18,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 07:01:18,057 INFO L278 TraceCheckSpWp]: Computing forward predicates...