./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-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.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 bd156d4b261f7974faf7f6b78b2668e560141098ddc5f2a0a7e1c7933cffbab8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:40:27,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:40:27,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:40:27,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:40:27,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:40:27,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:40:27,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:40:27,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:40:27,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:40:27,228 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:40:27,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:40:27,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:40:27,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:40:27,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:40:27,231 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:40:27,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:40:27,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:40:27,232 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:40:27,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:40:27,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:40:27,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:40:27,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:40:27,236 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:40:27,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:40:27,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:40:27,236 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:40:27,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:40:27,237 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:40:27,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:40:27,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:40:27,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:40:27,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:40:27,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:40:27,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:40:27,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:40:27,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:40:27,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:40:27,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:40:27,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:40:27,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:40:27,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:40:27,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:40:27,240 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 -> bd156d4b261f7974faf7f6b78b2668e560141098ddc5f2a0a7e1c7933cffbab8 [2024-10-13 01:40:27,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:40:27,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:40:27,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:40:27,476 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:40:27,477 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:40:27,478 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-74.i [2024-10-13 01:40:28,749 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:40:28,923 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:40:28,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.i [2024-10-13 01:40:28,932 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/803f9c1e3/d68526190622400a88051a1a7ba8e638/FLAGbc72863c1 [2024-10-13 01:40:29,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/803f9c1e3/d68526190622400a88051a1a7ba8e638 [2024-10-13 01:40:29,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:40:29,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:40:29,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:40:29,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:40:29,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:40:29,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:40:29" (1/1) ... [2024-10-13 01:40:29,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7758648d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:29, skipping insertion in model container [2024-10-13 01:40:29,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:40:29" (1/1) ... [2024-10-13 01:40:29,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:40:29,500 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-74.i[919,932] [2024-10-13 01:40:29,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:40:29,637 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:40:29,646 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-74.i[919,932] [2024-10-13 01:40:29,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:40:29,707 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:40:29,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:29 WrapperNode [2024-10-13 01:40:29,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:40:29,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:40:29,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:40:29,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:40:29,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:29" (1/1) ... [2024-10-13 01:40:29,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:29" (1/1) ... [2024-10-13 01:40:29,775 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-10-13 01:40:29,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:40:29,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:40:29,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:40:29,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:40:29,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:29" (1/1) ... [2024-10-13 01:40:29,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:29" (1/1) ... [2024-10-13 01:40:29,791 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:29" (1/1) ... [2024-10-13 01:40:29,821 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-13 01:40:29,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:29" (1/1) ... [2024-10-13 01:40:29,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:29" (1/1) ... [2024-10-13 01:40:29,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:29" (1/1) ... [2024-10-13 01:40:29,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:29" (1/1) ... [2024-10-13 01:40:29,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:29" (1/1) ... [2024-10-13 01:40:29,841 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:29" (1/1) ... [2024-10-13 01:40:29,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:40:29,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:40:29,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:40:29,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:40:29,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:29" (1/1) ... [2024-10-13 01:40:29,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:40:29,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:40:29,883 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-13 01:40:29,886 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-13 01:40:29,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:40:29,935 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:40:29,935 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:40:29,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:40:29,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:40:29,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:40:30,017 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:40:30,019 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:40:30,430 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-13 01:40:30,431 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:40:30,477 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:40:30,478 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:40:30,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:40:30 BoogieIcfgContainer [2024-10-13 01:40:30,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:40:30,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:40:30,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:40:30,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:40:30,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:40:29" (1/3) ... [2024-10-13 01:40:30,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7682ad4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:40:30, skipping insertion in model container [2024-10-13 01:40:30,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:29" (2/3) ... [2024-10-13 01:40:30,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7682ad4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:40:30, skipping insertion in model container [2024-10-13 01:40:30,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:40:30" (3/3) ... [2024-10-13 01:40:30,489 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.i [2024-10-13 01:40:30,502 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:40:30,502 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:40:30,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:40:30,557 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;@477c2d53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:40:30,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:40:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 67 states have (on average 1.537313432835821) internal successors, (103), 68 states have internal predecessors, (103), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 01:40:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 01:40:30,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:30,572 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:30,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:30,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:30,577 INFO L85 PathProgramCache]: Analyzing trace with hash -591272469, now seen corresponding path program 1 times [2024-10-13 01:40:30,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:30,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610045854] [2024-10-13 01:40:30,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:30,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:40:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:40:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:40:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:40:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:40:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:40:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:40:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:40:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:40:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:40:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:40:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:40:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:40:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:40:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:40:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:40:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:40:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:40:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:40:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 01:40:30,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:30,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610045854] [2024-10-13 01:40:30,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610045854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:40:30,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:40:30,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:40:30,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877997548] [2024-10-13 01:40:30,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:40:30,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:40:30,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:31,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:40:31,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:40:31,009 INFO L87 Difference]: Start difference. First operand has 92 states, 67 states have (on average 1.537313432835821) internal successors, (103), 68 states have internal predecessors, (103), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 01:40:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:31,051 INFO L93 Difference]: Finished difference Result 180 states and 312 transitions. [2024-10-13 01:40:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:40:31,055 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 150 [2024-10-13 01:40:31,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:31,063 INFO L225 Difference]: With dead ends: 180 [2024-10-13 01:40:31,063 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 01:40:31,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-13 01:40:31,071 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:31,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:40:31,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 01:40:31,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-13 01:40:31,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 01:40:31,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 135 transitions. [2024-10-13 01:40:31,124 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 135 transitions. Word has length 150 [2024-10-13 01:40:31,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:31,125 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 135 transitions. [2024-10-13 01:40:31,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 01:40:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 135 transitions. [2024-10-13 01:40:31,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 01:40:31,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:31,131 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:31,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:40:31,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:31,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:31,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1896921761, now seen corresponding path program 1 times [2024-10-13 01:40:31,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:31,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894509143] [2024-10-13 01:40:31,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:31,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:40:31,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:40:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:40:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:40:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:40:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:40:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:40:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:40:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:40:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:40:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:40:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:40:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:40:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:40:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:40:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:40:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:40:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:40:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:40:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,399 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 01:40:31,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:31,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894509143] [2024-10-13 01:40:31,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894509143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:40:31,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:40:31,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:40:31,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208663821] [2024-10-13 01:40:31,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:40:31,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:40:31,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:31,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:40:31,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:40:31,402 INFO L87 Difference]: Start difference. First operand 89 states and 135 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:40:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:31,479 INFO L93 Difference]: Finished difference Result 227 states and 341 transitions. [2024-10-13 01:40:31,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:40:31,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2024-10-13 01:40:31,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:31,482 INFO L225 Difference]: With dead ends: 227 [2024-10-13 01:40:31,482 INFO L226 Difference]: Without dead ends: 139 [2024-10-13 01:40:31,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-13 01:40:31,484 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 68 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:31,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 246 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:40:31,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-13 01:40:31,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2024-10-13 01:40:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 104 states have internal predecessors, (142), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 01:40:31,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 202 transitions. [2024-10-13 01:40:31,513 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 202 transitions. Word has length 150 [2024-10-13 01:40:31,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:31,514 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 202 transitions. [2024-10-13 01:40:31,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:40:31,514 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 202 transitions. [2024-10-13 01:40:31,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 01:40:31,516 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:31,516 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:31,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 01:40:31,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:31,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:31,517 INFO L85 PathProgramCache]: Analyzing trace with hash 809697633, now seen corresponding path program 1 times [2024-10-13 01:40:31,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:31,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821724865] [2024-10-13 01:40:31,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:31,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:40:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:40:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:40:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:40:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:40:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:40:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:40:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:40:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:31,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:40:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:32,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:40:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:32,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:40:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:32,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:40:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:32,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:40:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:32,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:40:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:32,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:40:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:32,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:40:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:32,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:40:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:32,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:32,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:32,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:40:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:32,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:40:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 01:40:32,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:32,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821724865] [2024-10-13 01:40:32,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821724865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:40:32,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:40:32,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 01:40:32,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944975830] [2024-10-13 01:40:32,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:40:32,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:40:32,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:32,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:40:32,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:40:32,041 INFO L87 Difference]: Start difference. First operand 136 states and 202 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:40:32,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:32,476 INFO L93 Difference]: Finished difference Result 437 states and 637 transitions. [2024-10-13 01:40:32,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 01:40:32,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2024-10-13 01:40:32,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:32,482 INFO L225 Difference]: With dead ends: 437 [2024-10-13 01:40:32,482 INFO L226 Difference]: Without dead ends: 302 [2024-10-13 01:40:32,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 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-13 01:40:32,484 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 226 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:32,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 332 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 01:40:32,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-13 01:40:32,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 241. [2024-10-13 01:40:32,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 187 states have (on average 1.3529411764705883) internal successors, (253), 190 states have internal predecessors, (253), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 01:40:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 349 transitions. [2024-10-13 01:40:32,527 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 349 transitions. Word has length 150 [2024-10-13 01:40:32,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:32,528 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 349 transitions. [2024-10-13 01:40:32,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:40:32,528 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 349 transitions. [2024-10-13 01:40:32,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-13 01:40:32,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:32,529 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:32,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 01:40:32,530 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:32,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:32,533 INFO L85 PathProgramCache]: Analyzing trace with hash 222891619, now seen corresponding path program 1 times [2024-10-13 01:40:32,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:32,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522891498] [2024-10-13 01:40:32,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:32,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:32,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:32,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:40:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:32,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:40:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:32,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:40:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:40:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:40:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:40:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:40:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:40:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:40:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:40:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:40:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:40:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:40:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:40:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:40:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:40:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:40:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:40:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:40:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,107 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 01:40:33,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:33,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522891498] [2024-10-13 01:40:33,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522891498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:40:33,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:40:33,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 01:40:33,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007749101] [2024-10-13 01:40:33,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:40:33,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:40:33,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:33,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:40:33,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:40:33,109 INFO L87 Difference]: Start difference. First operand 241 states and 349 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:40:33,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:33,370 INFO L93 Difference]: Finished difference Result 682 states and 981 transitions. [2024-10-13 01:40:33,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 01:40:33,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2024-10-13 01:40:33,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:33,374 INFO L225 Difference]: With dead ends: 682 [2024-10-13 01:40:33,374 INFO L226 Difference]: Without dead ends: 442 [2024-10-13 01:40:33,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 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-13 01:40:33,376 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 102 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:33,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 435 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:40:33,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-13 01:40:33,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 295. [2024-10-13 01:40:33,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 215 states have (on average 1.3069767441860465) internal successors, (281), 218 states have internal predecessors, (281), 70 states have call successors, (70), 9 states have call predecessors, (70), 9 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 01:40:33,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 421 transitions. [2024-10-13 01:40:33,416 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 421 transitions. Word has length 150 [2024-10-13 01:40:33,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:33,417 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 421 transitions. [2024-10-13 01:40:33,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:40:33,421 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 421 transitions. [2024-10-13 01:40:33,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 01:40:33,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:33,423 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:33,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 01:40:33,423 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:33,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:33,423 INFO L85 PathProgramCache]: Analyzing trace with hash 940551907, now seen corresponding path program 1 times [2024-10-13 01:40:33,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:33,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144396876] [2024-10-13 01:40:33,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:33,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:40:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:40:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:40:33,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:40:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:40:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:40:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:40:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:40:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:40:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:40:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:40:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:40:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:40:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:40:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:40:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:40:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:40:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:40:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:40:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:33,898 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 01:40:33,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:33,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144396876] [2024-10-13 01:40:33,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144396876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:40:33,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:40:33,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 01:40:33,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805530879] [2024-10-13 01:40:33,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:40:33,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 01:40:33,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:33,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 01:40:33,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 01:40:33,901 INFO L87 Difference]: Start difference. First operand 295 states and 421 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:40:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:34,178 INFO L93 Difference]: Finished difference Result 682 states and 980 transitions. [2024-10-13 01:40:34,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 01:40:34,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2024-10-13 01:40:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:34,181 INFO L225 Difference]: With dead ends: 682 [2024-10-13 01:40:34,181 INFO L226 Difference]: Without dead ends: 442 [2024-10-13 01:40:34,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 01:40:34,183 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 100 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:34,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 436 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:40:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-10-13 01:40:34,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 296. [2024-10-13 01:40:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 216 states have (on average 1.3055555555555556) internal successors, (282), 219 states have internal predecessors, (282), 70 states have call successors, (70), 9 states have call predecessors, (70), 9 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 01:40:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 422 transitions. [2024-10-13 01:40:34,225 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 422 transitions. Word has length 151 [2024-10-13 01:40:34,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:34,225 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 422 transitions. [2024-10-13 01:40:34,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:40:34,226 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 422 transitions. [2024-10-13 01:40:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 01:40:34,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:34,227 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:34,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 01:40:34,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:34,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:34,228 INFO L85 PathProgramCache]: Analyzing trace with hash 806538401, now seen corresponding path program 1 times [2024-10-13 01:40:34,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:34,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605149689] [2024-10-13 01:40:34,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:34,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:40:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:40:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:40:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:40:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:40:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:40:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:40:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:40:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:40:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:40:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:40:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:40:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:40:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:40:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:40:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:40:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:40:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:40:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:40:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 01:40:34,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:34,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605149689] [2024-10-13 01:40:34,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605149689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:40:34,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:40:34,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:40:34,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504871953] [2024-10-13 01:40:34,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:40:34,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:40:34,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:34,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:40:34,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:40:34,483 INFO L87 Difference]: Start difference. First operand 296 states and 422 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:40:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:34,754 INFO L93 Difference]: Finished difference Result 707 states and 1019 transitions. [2024-10-13 01:40:34,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:40:34,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2024-10-13 01:40:34,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:34,758 INFO L225 Difference]: With dead ends: 707 [2024-10-13 01:40:34,759 INFO L226 Difference]: Without dead ends: 467 [2024-10-13 01:40:34,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:40:34,760 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 222 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:34,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 241 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:40:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-10-13 01:40:34,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 308. [2024-10-13 01:40:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 228 states have (on average 1.2982456140350878) internal successors, (296), 231 states have internal predecessors, (296), 70 states have call successors, (70), 9 states have call predecessors, (70), 9 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 01:40:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 436 transitions. [2024-10-13 01:40:34,800 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 436 transitions. Word has length 151 [2024-10-13 01:40:34,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:34,801 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 436 transitions. [2024-10-13 01:40:34,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:40:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 436 transitions. [2024-10-13 01:40:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-13 01:40:34,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:34,802 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:34,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 01:40:34,803 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:34,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:34,803 INFO L85 PathProgramCache]: Analyzing trace with hash 417129021, now seen corresponding path program 1 times [2024-10-13 01:40:34,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:34,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774962888] [2024-10-13 01:40:34,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:34,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:40:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:40:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:40:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:40:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:40:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:40:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:40:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:40:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:40:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:40:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:40:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:40:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:40:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:40:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:40:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:40:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:40:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:40:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:40:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 01:40:35,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:35,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774962888] [2024-10-13 01:40:35,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774962888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:40:35,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:40:35,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:40:35,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955960297] [2024-10-13 01:40:35,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:40:35,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:40:35,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:35,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:40:35,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:40:35,188 INFO L87 Difference]: Start difference. First operand 308 states and 436 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:40:35,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:35,283 INFO L93 Difference]: Finished difference Result 567 states and 809 transitions. [2024-10-13 01:40:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:40:35,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2024-10-13 01:40:35,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:35,285 INFO L225 Difference]: With dead ends: 567 [2024-10-13 01:40:35,285 INFO L226 Difference]: Without dead ends: 315 [2024-10-13 01:40:35,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:40:35,287 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 113 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:35,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 429 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:40:35,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-13 01:40:35,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 308. [2024-10-13 01:40:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 228 states have (on average 1.280701754385965) internal successors, (292), 231 states have internal predecessors, (292), 70 states have call successors, (70), 9 states have call predecessors, (70), 9 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 01:40:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 432 transitions. [2024-10-13 01:40:35,327 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 432 transitions. Word has length 152 [2024-10-13 01:40:35,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:35,327 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 432 transitions. [2024-10-13 01:40:35,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:40:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 432 transitions. [2024-10-13 01:40:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 01:40:35,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:35,329 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:35,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 01:40:35,329 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:35,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:35,330 INFO L85 PathProgramCache]: Analyzing trace with hash 868257836, now seen corresponding path program 1 times [2024-10-13 01:40:35,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:35,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736745479] [2024-10-13 01:40:35,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:35,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:40:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:40:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:40:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:40:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:40:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:40:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:40:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:40:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:40:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:40:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:40:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:40:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:40:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:40:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:40:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:40:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:40:35,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:40:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:40:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 01:40:35,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:35,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736745479] [2024-10-13 01:40:35,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736745479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:40:35,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:40:35,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 01:40:35,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954275423] [2024-10-13 01:40:35,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:40:35,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 01:40:35,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:35,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 01:40:35,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 01:40:35,771 INFO L87 Difference]: Start difference. First operand 308 states and 432 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:40:36,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:36,507 INFO L93 Difference]: Finished difference Result 1007 states and 1418 transitions. [2024-10-13 01:40:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 01:40:36,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 154 [2024-10-13 01:40:36,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:36,511 INFO L225 Difference]: With dead ends: 1007 [2024-10-13 01:40:36,511 INFO L226 Difference]: Without dead ends: 707 [2024-10-13 01:40:36,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-13 01:40:36,513 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 200 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:36,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 854 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 01:40:36,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-10-13 01:40:36,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 365. [2024-10-13 01:40:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 285 states have (on average 1.2982456140350878) internal successors, (370), 288 states have internal predecessors, (370), 70 states have call successors, (70), 9 states have call predecessors, (70), 9 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 01:40:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 510 transitions. [2024-10-13 01:40:36,582 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 510 transitions. Word has length 154 [2024-10-13 01:40:36,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:36,582 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 510 transitions. [2024-10-13 01:40:36,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:40:36,583 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 510 transitions. [2024-10-13 01:40:36,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 01:40:36,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:36,584 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:36,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 01:40:36,584 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:36,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:36,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1125886870, now seen corresponding path program 1 times [2024-10-13 01:40:36,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:36,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523330434] [2024-10-13 01:40:36,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:36,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:40:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:40:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:40:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:40:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:40:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:40:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:40:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:40:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:40:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:40:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:40:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:40:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:40:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:40:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:40:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:40:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:40:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:40:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:40:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-13 01:40:36,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:36,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523330434] [2024-10-13 01:40:36,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523330434] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:40:36,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825775997] [2024-10-13 01:40:36,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:36,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:40:36,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:40:36,892 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-13 01:40:36,894 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-13 01:40:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:37,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 01:40:37,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:40:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 481 proven. 33 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-10-13 01:40:37,294 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:40:37,528 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-13 01:40:37,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825775997] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:40:37,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:40:37,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-10-13 01:40:37,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860840555] [2024-10-13 01:40:37,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:40:37,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 01:40:37,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:37,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 01:40:37,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-10-13 01:40:37,530 INFO L87 Difference]: Start difference. First operand 365 states and 510 transitions. Second operand has 15 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2024-10-13 01:40:38,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:38,342 INFO L93 Difference]: Finished difference Result 779 states and 1088 transitions. [2024-10-13 01:40:38,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-13 01:40:38,343 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 154 [2024-10-13 01:40:38,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:38,345 INFO L225 Difference]: With dead ends: 779 [2024-10-13 01:40:38,346 INFO L226 Difference]: Without dead ends: 454 [2024-10-13 01:40:38,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2024-10-13 01:40:38,347 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 391 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:38,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 592 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 01:40:38,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-10-13 01:40:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 331. [2024-10-13 01:40:38,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 249 states have (on average 1.2771084337349397) internal successors, (318), 252 states have internal predecessors, (318), 70 states have call successors, (70), 11 states have call predecessors, (70), 11 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 01:40:38,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 458 transitions. [2024-10-13 01:40:38,397 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 458 transitions. Word has length 154 [2024-10-13 01:40:38,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:38,397 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 458 transitions. [2024-10-13 01:40:38,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2024-10-13 01:40:38,397 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 458 transitions. [2024-10-13 01:40:38,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 01:40:38,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:38,399 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:38,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 01:40:38,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:40:38,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:38,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:38,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2147305355, now seen corresponding path program 1 times [2024-10-13 01:40:38,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:38,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563326612] [2024-10-13 01:40:38,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:38,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:40:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:40:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:40:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:40:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:40:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:40:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:40:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:40:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:40:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:40:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:40:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:40:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:40:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:40:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:40:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:40:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:40:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:40:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:40:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 01:40:38,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:38,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563326612] [2024-10-13 01:40:38,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563326612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:40:38,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:40:38,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 01:40:38,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673800197] [2024-10-13 01:40:38,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:40:38,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 01:40:38,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:38,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 01:40:38,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 01:40:38,861 INFO L87 Difference]: Start difference. First operand 331 states and 458 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:40:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:39,347 INFO L93 Difference]: Finished difference Result 941 states and 1317 transitions. [2024-10-13 01:40:39,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 01:40:39,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2024-10-13 01:40:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:39,351 INFO L225 Difference]: With dead ends: 941 [2024-10-13 01:40:39,351 INFO L226 Difference]: Without dead ends: 670 [2024-10-13 01:40:39,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 01:40:39,352 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 209 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:39,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 593 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 01:40:39,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-10-13 01:40:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 447. [2024-10-13 01:40:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 365 states have (on average 1.3150684931506849) internal successors, (480), 368 states have internal predecessors, (480), 70 states have call successors, (70), 11 states have call predecessors, (70), 11 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 01:40:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 620 transitions. [2024-10-13 01:40:39,417 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 620 transitions. Word has length 155 [2024-10-13 01:40:39,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:39,418 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 620 transitions. [2024-10-13 01:40:39,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:40:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 620 transitions. [2024-10-13 01:40:39,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 01:40:39,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:39,421 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:39,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 01:40:39,421 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:39,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:39,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2038473269, now seen corresponding path program 1 times [2024-10-13 01:40:39,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:39,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864905687] [2024-10-13 01:40:39,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:39,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:40:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:40:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:40:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:40:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:40:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:40:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:40:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:40:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:40:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:40:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:40:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:40:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:40:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:40:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:40:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:40:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:40:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:40:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:40:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,860 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 33 proven. 30 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-13 01:40:39,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:39,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864905687] [2024-10-13 01:40:39,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864905687] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:40:39,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109084411] [2024-10-13 01:40:39,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:39,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:40:39,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:40:39,862 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:40:39,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 01:40:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:39,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-13 01:40:40,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:40:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 494 proven. 60 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-13 01:40:40,372 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:40:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 60 proven. 63 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2024-10-13 01:40:40,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109084411] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:40:40,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:40:40,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 24 [2024-10-13 01:40:40,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328523729] [2024-10-13 01:40:40,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:40:40,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 01:40:40,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:40,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 01:40:40,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2024-10-13 01:40:40,764 INFO L87 Difference]: Start difference. First operand 447 states and 620 transitions. Second operand has 24 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 6 states have call successors, (44), 3 states have call predecessors, (44), 6 states have return successors, (46), 6 states have call predecessors, (46), 6 states have call successors, (46) [2024-10-13 01:40:42,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:42,921 INFO L93 Difference]: Finished difference Result 1315 states and 1815 transitions. [2024-10-13 01:40:42,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-13 01:40:42,927 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 6 states have call successors, (44), 3 states have call predecessors, (44), 6 states have return successors, (46), 6 states have call predecessors, (46), 6 states have call successors, (46) Word has length 155 [2024-10-13 01:40:42,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:42,931 INFO L225 Difference]: With dead ends: 1315 [2024-10-13 01:40:42,931 INFO L226 Difference]: Without dead ends: 780 [2024-10-13 01:40:42,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1240 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=942, Invalid=3614, Unknown=0, NotChecked=0, Total=4556 [2024-10-13 01:40:42,933 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1097 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:42,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 1124 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 1594 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 01:40:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-10-13 01:40:43,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 562. [2024-10-13 01:40:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 451 states have (on average 1.2993348115299335) internal successors, (586), 456 states have internal predecessors, (586), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-13 01:40:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 770 transitions. [2024-10-13 01:40:43,004 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 770 transitions. Word has length 155 [2024-10-13 01:40:43,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:43,004 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 770 transitions. [2024-10-13 01:40:43,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.565217391304348) internal successors, (128), 22 states have internal predecessors, (128), 6 states have call successors, (44), 3 states have call predecessors, (44), 6 states have return successors, (46), 6 states have call predecessors, (46), 6 states have call successors, (46) [2024-10-13 01:40:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 770 transitions. [2024-10-13 01:40:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 01:40:43,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:43,007 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:43,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 01:40:43,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 01:40:43,212 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:43,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:43,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1675852177, now seen corresponding path program 1 times [2024-10-13 01:40:43,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:43,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419270291] [2024-10-13 01:40:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:43,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:40:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:40:43,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:40:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:40:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:40:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:40:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:40:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:40:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:40:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:40:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:40:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:40:43,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:40:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:40:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:40:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:40:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:40:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:40:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:40:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 01:40:43,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:43,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419270291] [2024-10-13 01:40:43,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419270291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:40:43,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:40:43,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 01:40:43,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068608935] [2024-10-13 01:40:43,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:40:43,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 01:40:43,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:43,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 01:40:43,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-13 01:40:43,736 INFO L87 Difference]: Start difference. First operand 562 states and 770 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:40:44,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:44,440 INFO L93 Difference]: Finished difference Result 1316 states and 1792 transitions. [2024-10-13 01:40:44,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 01:40:44,441 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-10-13 01:40:44,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:44,445 INFO L225 Difference]: With dead ends: 1316 [2024-10-13 01:40:44,445 INFO L226 Difference]: Without dead ends: 764 [2024-10-13 01:40:44,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-13 01:40:44,448 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 307 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:44,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 725 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 01:40:44,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2024-10-13 01:40:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 570. [2024-10-13 01:40:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 459 states have (on average 1.2941176470588236) internal successors, (594), 464 states have internal predecessors, (594), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-13 01:40:44,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 778 transitions. [2024-10-13 01:40:44,532 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 778 transitions. Word has length 156 [2024-10-13 01:40:44,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:44,533 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 778 transitions. [2024-10-13 01:40:44,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:40:44,533 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 778 transitions. [2024-10-13 01:40:44,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 01:40:44,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:44,534 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:44,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 01:40:44,535 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:44,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:44,536 INFO L85 PathProgramCache]: Analyzing trace with hash -318292529, now seen corresponding path program 1 times [2024-10-13 01:40:44,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:44,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7897123] [2024-10-13 01:40:44,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:44,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:40:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:40:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:40:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:40:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:40:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:40:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:40:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:40:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:40:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 01:40:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 01:40:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 01:40:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 01:40:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 01:40:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 01:40:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 01:40:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 01:40:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:40:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:40:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:40:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 01:40:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 01:40:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 01:40:45,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:40:45,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7897123] [2024-10-13 01:40:45,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7897123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:40:45,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:40:45,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 01:40:45,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646835056] [2024-10-13 01:40:45,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:40:45,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 01:40:45,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:40:45,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 01:40:45,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-13 01:40:45,977 INFO L87 Difference]: Start difference. First operand 570 states and 778 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 01:40:47,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:40:47,726 INFO L93 Difference]: Finished difference Result 1312 states and 1793 transitions. [2024-10-13 01:40:47,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 01:40:47,727 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 156 [2024-10-13 01:40:47,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:40:47,731 INFO L225 Difference]: With dead ends: 1312 [2024-10-13 01:40:47,731 INFO L226 Difference]: Without dead ends: 806 [2024-10-13 01:40:47,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-10-13 01:40:47,734 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 557 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:40:47,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 572 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 01:40:47,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2024-10-13 01:40:47,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 592. [2024-10-13 01:40:47,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 481 states have (on average 1.288981288981289) internal successors, (620), 486 states have internal predecessors, (620), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-13 01:40:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 804 transitions. [2024-10-13 01:40:47,823 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 804 transitions. Word has length 156 [2024-10-13 01:40:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:40:47,825 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 804 transitions. [2024-10-13 01:40:47,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 01:40:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 804 transitions. [2024-10-13 01:40:47,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 01:40:47,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:47,827 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:47,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 01:40:47,827 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:47,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:47,828 INFO L85 PathProgramCache]: Analyzing trace with hash 858203727, now seen corresponding path program 1 times [2024-10-13 01:40:47,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:40:47,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606285942] [2024-10-13 01:40:47,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:47,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:40:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:40:47,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [630689179] [2024-10-13 01:40:47,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:47,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:40:47,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:40:47,900 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:40:47,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 01:40:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:40:48,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 01:40:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:40:48,364 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 01:40:48,365 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 01:40:48,366 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 01:40:48,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 01:40:48,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:40:48,571 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:40:48,669 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 01:40:48,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:40:48 BoogieIcfgContainer [2024-10-13 01:40:48,672 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 01:40:48,672 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 01:40:48,672 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 01:40:48,673 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 01:40:48,673 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:40:30" (3/4) ... [2024-10-13 01:40:48,675 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 01:40:48,676 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 01:40:48,676 INFO L158 Benchmark]: Toolchain (without parser) took 19365.47ms. Allocated memory was 165.7MB in the beginning and 474.0MB in the end (delta: 308.3MB). Free memory was 98.6MB in the beginning and 349.3MB in the end (delta: -250.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-10-13 01:40:48,676 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 165.7MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:40:48,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.58ms. Allocated memory is still 165.7MB. Free memory was 98.5MB in the beginning and 131.7MB in the end (delta: -33.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-10-13 01:40:48,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.33ms. Allocated memory is still 165.7MB. Free memory was 130.9MB in the beginning and 125.9MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 01:40:48,677 INFO L158 Benchmark]: Boogie Preprocessor took 72.26ms. Allocated memory is still 165.7MB. Free memory was 125.9MB in the beginning and 118.3MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 01:40:48,677 INFO L158 Benchmark]: RCFGBuilder took 631.87ms. Allocated memory is still 165.7MB. Free memory was 118.3MB in the beginning and 82.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-13 01:40:48,678 INFO L158 Benchmark]: TraceAbstraction took 18189.36ms. Allocated memory was 165.7MB in the beginning and 474.0MB in the end (delta: 308.3MB). Free memory was 81.8MB in the beginning and 350.4MB in the end (delta: -268.6MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. [2024-10-13 01:40:48,678 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 474.0MB. Free memory is still 349.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:40:48,679 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.18ms. Allocated memory is still 165.7MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.58ms. Allocated memory is still 165.7MB. Free memory was 98.5MB in the beginning and 131.7MB in the end (delta: -33.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.33ms. Allocated memory is still 165.7MB. Free memory was 130.9MB in the beginning and 125.9MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.26ms. Allocated memory is still 165.7MB. Free memory was 125.9MB in the beginning and 118.3MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 631.87ms. Allocated memory is still 165.7MB. Free memory was 118.3MB in the beginning and 82.7MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18189.36ms. Allocated memory was 165.7MB in the beginning and 474.0MB in the end (delta: 308.3MB). Free memory was 81.8MB in the beginning and 350.4MB in the end (delta: -268.6MB). Peak memory consumption was 42.4MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 474.0MB. Free memory is still 349.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of bitwiseOr at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryArithmeticFLOAToperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] unsigned char var_1_4 = 0; [L24] unsigned long int var_1_5 = 3914692693; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 50; [L30] signed long int var_1_12 = 25; [L31] signed long int var_1_13 = 1; [L32] float var_1_15 = 4.75; [L33] unsigned char var_1_16 = 100; [L34] float var_1_17 = 50.1; [L35] float var_1_18 = 100.9; [L36] float var_1_19 = 8.5; [L37] float var_1_20 = 10.625; [L38] float var_1_21 = 0.0; [L39] float var_1_22 = 7.8; [L40] float var_1_23 = 8.25; [L41] double var_1_24 = 5.5; [L42] signed char var_1_25 = -16; [L43] float var_1_28 = 3.5; [L44] signed short int var_1_29 = -8; [L45] signed char var_1_31 = -32; [L46] signed char var_1_32 = 2; [L47] signed long int var_1_34 = -4; [L48] double var_1_38 = 0.5; [L49] unsigned long int last_1_var_1_1 = 64; [L50] unsigned char last_1_var_1_11 = 50; [L182] isInitial = 1 [L183] FCALL initially() [L184] COND TRUE 1 [L185] CALL updateLastVariables() [L174] last_1_var_1_1 = var_1_1 [L175] last_1_var_1_11 = var_1_11 [L185] RET updateLastVariables() [L186] CALL updateVariables() [L136] var_1_4 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L137] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L138] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L139] var_1_5 = __VERIFIER_nondet_ulong() [L140] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L141] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L142] var_1_7 = __VERIFIER_nondet_ulong() [L143] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L144] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L145] var_1_9 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L146] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L147] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L147] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L148] var_1_10 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L149] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L150] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L150] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L151] var_1_12 = __VERIFIER_nondet_long() [L152] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L153] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L153] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L154] var_1_13 = __VERIFIER_nondet_long() [L155] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L156] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L157] var_1_16 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L159] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L160] var_1_17 = __VERIFIER_nondet_float() [L161] 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_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L161] 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_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L162] var_1_19 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L163] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L164] var_1_20 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L165] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L166] var_1_21 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L167] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L168] var_1_22 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L169] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L170] var_1_23 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L171] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L186] RET updateVariables() [L187] CALL step() [L54] signed long int stepLocal_1 = last_1_var_1_11; [L55] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, stepLocal_1=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L56] COND TRUE stepLocal_1 < last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L57] COND FALSE !(last_1_var_1_1 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L61] unsigned long int stepLocal_3 = var_1_7; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L62] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L62] unsigned long int stepLocal_2 = 5u << (var_1_12 - var_1_13); [L63] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_8)) [L74] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L76] COND FALSE !(! (var_1_11 >= var_1_11)) [L83] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L85] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L90] COND FALSE !(\read(var_1_10)) [L93] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L95] unsigned long int stepLocal_4 = ~ var_1_1; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, stepLocal_4=4294967281, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L96] COND FALSE !(stepLocal_4 <= (var_1_12 - var_1_11)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L99] COND FALSE !((~ (var_1_5 % 200u)) < 32u) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L102] COND TRUE var_1_12 > var_1_16 [L103] var_1_28 = ((((4.2f) < (1.25f)) ? (4.2f) : (1.25f))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L105] COND TRUE (~ (5 + var_1_16)) >= 10000u [L106] var_1_29 = (((((var_1_13 + var_1_12)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((var_1_13 + var_1_12)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L110] var_1_31 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L111] EXPR var_1_1 | -5 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L111] EXPR ((var_1_13) < ((var_1_1 | -5))) ? (var_1_13) : ((var_1_1 | -5)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L111] COND TRUE var_1_11 <= ((((var_1_13) < ((var_1_1 | -5))) ? (var_1_13) : ((var_1_1 | -5)))) [L112] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L116] COND TRUE ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12))) <= var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L117] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L133] var_1_38 = var_1_19 [L187] RET step() [L188] CALL, EXPR property() [L178] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L178] EXPR (! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L178] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L178-L179] return ((((((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_1 > (var_1_11 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_1) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.0s, OverallIterations: 14, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3625 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3592 mSDsluCounter, 6710 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4856 mSDsCounter, 1263 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4749 IncrementalHoareTripleChecker+Invalid, 6012 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1263 mSolverCounterUnsat, 1854 mSDtfsCounter, 4749 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1399 GetRequests, 1237 SyntacticMatches, 2 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=592occurred in iteration=13, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 1837 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2605 NumberOfCodeBlocks, 2605 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2585 ConstructedInterpolants, 0 QuantifiedInterpolants, 9539 SizeOfPredicates, 10 NumberOfNonLiveVariables, 720 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 15456/15708 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-13 01:40:48,743 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-74.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 bd156d4b261f7974faf7f6b78b2668e560141098ddc5f2a0a7e1c7933cffbab8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:40:50,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:40:50,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 01:40:50,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:40:50,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:40:50,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:40:50,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:40:50,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:40:50,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:40:50,724 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:40:50,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:40:50,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:40:50,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:40:50,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:40:50,726 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:40:50,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:40:50,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:40:50,727 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:40:50,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:40:50,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:40:50,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:40:50,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:40:50,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:40:50,731 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 01:40:50,731 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 01:40:50,731 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:40:50,731 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 01:40:50,732 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:40:50,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:40:50,732 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:40:50,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:40:50,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:40:50,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:40:50,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:40:50,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:40:50,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:40:50,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:40:50,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:40:50,736 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 01:40:50,736 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 01:40:50,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:40:50,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:40:50,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:40:50,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:40:50,738 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 01:40:50,738 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 -> bd156d4b261f7974faf7f6b78b2668e560141098ddc5f2a0a7e1c7933cffbab8 [2024-10-13 01:40:51,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:40:51,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:40:51,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:40:51,035 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:40:51,035 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:40:51,038 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-74.i [2024-10-13 01:40:52,365 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:40:52,590 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:40:52,591 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.i [2024-10-13 01:40:52,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10412fe53/7b4f650486874a78a28d87bb812e58c3/FLAG433548e44 [2024-10-13 01:40:52,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10412fe53/7b4f650486874a78a28d87bb812e58c3 [2024-10-13 01:40:52,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:40:52,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:40:52,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:40:52,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:40:52,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:40:52,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:40:52" (1/1) ... [2024-10-13 01:40:52,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@732f13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:52, skipping insertion in model container [2024-10-13 01:40:52,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:40:52" (1/1) ... [2024-10-13 01:40:53,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:40:53,163 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-74.i[919,932] [2024-10-13 01:40:53,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:40:53,253 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:40:53,266 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-74.i[919,932] [2024-10-13 01:40:53,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:40:53,316 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:40:53,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:53 WrapperNode [2024-10-13 01:40:53,317 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:40:53,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:40:53,318 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:40:53,318 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:40:53,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:53" (1/1) ... [2024-10-13 01:40:53,342 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:53" (1/1) ... [2024-10-13 01:40:53,375 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-10-13 01:40:53,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:40:53,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:40:53,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:40:53,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:40:53,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:53" (1/1) ... [2024-10-13 01:40:53,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:53" (1/1) ... [2024-10-13 01:40:53,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:53" (1/1) ... [2024-10-13 01:40:53,416 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-13 01:40:53,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:53" (1/1) ... [2024-10-13 01:40:53,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:53" (1/1) ... [2024-10-13 01:40:53,434 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:53" (1/1) ... [2024-10-13 01:40:53,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:53" (1/1) ... [2024-10-13 01:40:53,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:53" (1/1) ... [2024-10-13 01:40:53,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:53" (1/1) ... [2024-10-13 01:40:53,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:40:53,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:40:53,451 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:40:53,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:40:53,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:53" (1/1) ... [2024-10-13 01:40:53,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:40:53,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:40:53,481 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-13 01:40:53,483 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-13 01:40:53,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:40:53,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 01:40:53,521 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:40:53,521 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:40:53,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:40:53,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:40:53,608 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:40:53,611 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:40:56,324 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 01:40:56,324 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:40:56,396 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:40:56,396 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:40:56,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:40:56 BoogieIcfgContainer [2024-10-13 01:40:56,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:40:56,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:40:56,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:40:56,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:40:56,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:40:52" (1/3) ... [2024-10-13 01:40:56,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780fa3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:40:56, skipping insertion in model container [2024-10-13 01:40:56,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:40:53" (2/3) ... [2024-10-13 01:40:56,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780fa3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:40:56, skipping insertion in model container [2024-10-13 01:40:56,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:40:56" (3/3) ... [2024-10-13 01:40:56,405 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.i [2024-10-13 01:40:56,426 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:40:56,427 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:40:56,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:40:56,486 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;@261bc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:40:56,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:40:56,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 50 states have internal predecessors, (76), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 01:40:56,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 01:40:56,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:40:56,503 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:40:56,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:40:56,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:40:56,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1715579249, now seen corresponding path program 1 times [2024-10-13 01:40:56,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:40:56,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819111360] [2024-10-13 01:40:56,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:40:56,521 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-13 01:40:56,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:40:56,524 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-13 01:40:56,545 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-13 01:40:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:40:56,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 01:40:56,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:40:56,930 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-13 01:40:56,931 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:40:56,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:40:56,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819111360] [2024-10-13 01:40:56,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819111360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:40:56,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:40:56,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:40:56,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701123798] [2024-10-13 01:40:56,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:40:56,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:40:56,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:40:56,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:40:56,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:40:56,962 INFO L87 Difference]: Start difference. First operand has 74 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 50 states have internal predecessors, (76), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 01:41:00,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:41:00,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:41:00,034 INFO L93 Difference]: Finished difference Result 144 states and 258 transitions. [2024-10-13 01:41:00,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:41:00,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2024-10-13 01:41:00,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:41:00,066 INFO L225 Difference]: With dead ends: 144 [2024-10-13 01:41:00,066 INFO L226 Difference]: Without dead ends: 71 [2024-10-13 01:41:00,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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-13 01:41:00,071 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:41:00,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 01:41:00,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-13 01:41:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-13 01:41:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 01:41:00,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2024-10-13 01:41:00,110 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 144 [2024-10-13 01:41:00,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:41:00,110 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2024-10-13 01:41:00,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-13 01:41:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2024-10-13 01:41:00,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 01:41:00,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:41:00,115 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:41:00,127 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-13 01:41:00,319 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-13 01:41:00,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:41:00,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:41:00,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1009969571, now seen corresponding path program 1 times [2024-10-13 01:41:00,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:41:00,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499250269] [2024-10-13 01:41:00,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:00,321 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-13 01:41:00,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:41:00,327 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-13 01:41:00,329 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-13 01:41:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:00,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 01:41:00,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:41:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 01:41:02,397 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:41:02,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:41:02,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499250269] [2024-10-13 01:41:02,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499250269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:41:02,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:41:02,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:41:02,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232280692] [2024-10-13 01:41:02,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:41:02,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:41:02,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:41:02,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:41:02,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:41:02,400 INFO L87 Difference]: Start difference. First operand 71 states and 110 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:41:05,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:41:08,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:41:08,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:41:08,860 INFO L93 Difference]: Finished difference Result 212 states and 329 transitions. [2024-10-13 01:41:08,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 01:41:08,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-13 01:41:08,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:41:08,896 INFO L225 Difference]: With dead ends: 212 [2024-10-13 01:41:08,896 INFO L226 Difference]: Without dead ends: 142 [2024-10-13 01:41:08,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 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-13 01:41:08,898 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 71 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-10-13 01:41:08,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 350 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-10-13 01:41:08,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-13 01:41:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2024-10-13 01:41:08,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 66 states have internal predecessors, (85), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 01:41:08,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 173 transitions. [2024-10-13 01:41:08,923 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 173 transitions. Word has length 144 [2024-10-13 01:41:08,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:41:08,926 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 173 transitions. [2024-10-13 01:41:08,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:41:08,926 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 173 transitions. [2024-10-13 01:41:08,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 01:41:08,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:41:08,928 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:41:08,945 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-13 01:41:09,131 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-13 01:41:09,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:41:09,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:41:09,132 INFO L85 PathProgramCache]: Analyzing trace with hash 971567393, now seen corresponding path program 1 times [2024-10-13 01:41:09,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:41:09,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942906853] [2024-10-13 01:41:09,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:09,133 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-13 01:41:09,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:41:09,135 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-13 01:41:09,137 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-13 01:41:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:09,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 01:41:09,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:41:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-13 01:41:10,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:41:10,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:41:10,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942906853] [2024-10-13 01:41:10,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942906853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:41:10,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:41:10,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:41:10,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861146052] [2024-10-13 01:41:10,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:41:10,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:41:10,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:41:10,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:41:10,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:41:10,796 INFO L87 Difference]: Start difference. First operand 113 states and 173 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:41:13,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:41:16,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:41:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:41:16,816 INFO L93 Difference]: Finished difference Result 212 states and 328 transitions. [2024-10-13 01:41:16,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 01:41:16,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-10-13 01:41:16,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:41:16,846 INFO L225 Difference]: With dead ends: 212 [2024-10-13 01:41:16,847 INFO L226 Difference]: Without dead ends: 142 [2024-10-13 01:41:16,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 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-13 01:41:16,848 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 69 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-10-13 01:41:16,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 351 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-10-13 01:41:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-13 01:41:16,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 114. [2024-10-13 01:41:16,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 67 states have internal predecessors, (86), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 01:41:16,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 174 transitions. [2024-10-13 01:41:16,861 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 174 transitions. Word has length 145 [2024-10-13 01:41:16,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:41:16,862 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 174 transitions. [2024-10-13 01:41:16,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-13 01:41:16,862 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 174 transitions. [2024-10-13 01:41:16,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 01:41:16,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:41:16,865 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:41:16,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 01:41:17,065 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-13 01:41:17,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:41:17,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:41:17,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1022577313, now seen corresponding path program 1 times [2024-10-13 01:41:17,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:41:17,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458520926] [2024-10-13 01:41:17,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:17,068 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-13 01:41:17,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:41:17,070 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-13 01:41:17,071 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-13 01:41:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:17,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 01:41:17,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:41:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 494 proven. 60 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-13 01:41:18,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:41:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-13 01:41:19,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:41:19,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458520926] [2024-10-13 01:41:19,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458520926] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:41:19,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:41:19,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-10-13 01:41:19,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480028385] [2024-10-13 01:41:19,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:41:19,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 01:41:19,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:41:19,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 01:41:19,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-13 01:41:19,500 INFO L87 Difference]: Start difference. First operand 114 states and 174 transitions. Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-13 01:41:24,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:41:27,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:41:31,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:41:33,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 01:41:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:41:34,825 INFO L93 Difference]: Finished difference Result 301 states and 434 transitions. [2024-10-13 01:41:34,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 01:41:34,825 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 145 [2024-10-13 01:41:34,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:41:34,829 INFO L225 Difference]: With dead ends: 301 [2024-10-13 01:41:34,829 INFO L226 Difference]: Without dead ends: 231 [2024-10-13 01:41:34,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=288, Invalid=642, Unknown=0, NotChecked=0, Total=930 [2024-10-13 01:41:34,830 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 240 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:41:34,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 431 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2024-10-13 01:41:34,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-13 01:41:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 168. [2024-10-13 01:41:34,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 106 states have (on average 1.2547169811320755) internal successors, (133), 107 states have internal predecessors, (133), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 01:41:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 241 transitions. [2024-10-13 01:41:34,853 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 241 transitions. Word has length 145 [2024-10-13 01:41:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:41:34,853 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 241 transitions. [2024-10-13 01:41:34,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 16 states have internal predecessors, (68), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-13 01:41:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 241 transitions. [2024-10-13 01:41:34,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 01:41:34,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:41:34,855 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 01:41:34,874 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 (5)] Ended with exit code 0 [2024-10-13 01:41:35,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-13 01:41:35,056 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:41:35,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:41:35,057 INFO L85 PathProgramCache]: Analyzing trace with hash -321512735, now seen corresponding path program 1 times [2024-10-13 01:41:35,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:41:35,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193027206] [2024-10-13 01:41:35,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:41:35,057 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-13 01:41:35,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:41:35,058 INFO L229 MonitoredProcess]: Starting monitored process 6 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-13 01:41:35,059 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 (6)] Waiting until timeout for monitored process [2024-10-13 01:41:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:41:35,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-13 01:41:35,412 INFO L278 TraceCheckSpWp]: Computing forward predicates...