./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-63.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8d684ebe960d17f15dd8c83d8cf3e676853b2b7a1cdec8ea8ac85aafe28041c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:31:36,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:31:36,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:31:36,915 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:31:36,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:31:36,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:31:36,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:31:36,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:31:36,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:31:36,933 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:31:36,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:31:36,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:31:36,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:31:36,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:31:36,934 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:31:36,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:31:36,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:31:36,934 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:31:36,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:31:36,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:31:36,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:31:36,934 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:31:36,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:31:36,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:31:36,935 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:31:36,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:31:36,935 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:31:36,935 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:31:36,935 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:31:36,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:31:36,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:31:36,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:31:36,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:31:36,935 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:31:36,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:31:36,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:31:36,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:31:36,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:31:36,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:31:36,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:31:36,936 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:31:36,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:31:36,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:31:36,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:31:36,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:31:36,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:31:36,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:31:36,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:31:36,936 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 8d684ebe960d17f15dd8c83d8cf3e676853b2b7a1cdec8ea8ac85aafe28041c6 [2025-01-09 11:31:37,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:31:37,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:31:37,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:31:37,168 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:31:37,168 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:31:37,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-63.i [2025-01-09 11:31:38,349 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3cfd6a85/47b071e1353f46bb8882eab37c1d5405/FLAGfd93cc873 [2025-01-09 11:31:38,615 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:31:38,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-63.i [2025-01-09 11:31:38,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3cfd6a85/47b071e1353f46bb8882eab37c1d5405/FLAGfd93cc873 [2025-01-09 11:31:38,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3cfd6a85/47b071e1353f46bb8882eab37c1d5405 [2025-01-09 11:31:38,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:31:38,646 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:31:38,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:31:38,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:31:38,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:31:38,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:31:38" (1/1) ... [2025-01-09 11:31:38,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70260108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:31:38, skipping insertion in model container [2025-01-09 11:31:38,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:31:38" (1/1) ... [2025-01-09 11:31:38,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:31:38,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-63.i[919,932] [2025-01-09 11:31:38,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:31:38,872 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:31:38,879 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-63.i[919,932] [2025-01-09 11:31:38,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:31:38,926 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:31:38,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:31:38 WrapperNode [2025-01-09 11:31:38,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:31:38,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:31:38,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:31:38,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:31:38,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:31:38" (1/1) ... [2025-01-09 11:31:38,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:31:38" (1/1) ... [2025-01-09 11:31:38,994 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 282 [2025-01-09 11:31:38,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:31:38,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:31:38,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:31:38,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:31:39,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:31:38" (1/1) ... [2025-01-09 11:31:39,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:31:38" (1/1) ... [2025-01-09 11:31:39,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:31:38" (1/1) ... [2025-01-09 11:31:39,032 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]. [2025-01-09 11:31:39,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:31:38" (1/1) ... [2025-01-09 11:31:39,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:31:38" (1/1) ... [2025-01-09 11:31:39,047 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:31:38" (1/1) ... [2025-01-09 11:31:39,048 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:31:38" (1/1) ... [2025-01-09 11:31:39,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:31:38" (1/1) ... [2025-01-09 11:31:39,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:31:38" (1/1) ... [2025-01-09 11:31:39,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:31:38" (1/1) ... [2025-01-09 11:31:39,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:31:39,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:31:39,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:31:39,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:31:39,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:31:38" (1/1) ... [2025-01-09 11:31:39,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:31:39,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:31:39,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 11:31:39,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 11:31:39,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:31:39,115 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:31:39,116 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:31:39,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:31:39,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:31:39,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:31:39,189 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:31:39,190 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:31:39,584 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-01-09 11:31:39,584 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:31:39,594 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:31:39,594 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:31:39,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:31:39 BoogieIcfgContainer [2025-01-09 11:31:39,595 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:31:39,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:31:39,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:31:39,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:31:39,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:31:38" (1/3) ... [2025-01-09 11:31:39,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239ce6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:31:39, skipping insertion in model container [2025-01-09 11:31:39,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:31:38" (2/3) ... [2025-01-09 11:31:39,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239ce6a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:31:39, skipping insertion in model container [2025-01-09 11:31:39,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:31:39" (3/3) ... [2025-01-09 11:31:39,605 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-63.i [2025-01-09 11:31:39,614 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:31:39,616 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-63.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:31:39,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:31:39,657 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;@365cccac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:31:39,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:31:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 80 states have internal predecessors, (113), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 11:31:39,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 11:31:39,668 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:39,668 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:39,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:39,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:39,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1739098419, now seen corresponding path program 1 times [2025-01-09 11:31:39,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:39,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586580666] [2025-01-09 11:31:39,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:39,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:39,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 11:31:39,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 11:31:39,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:39,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-01-09 11:31:39,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:39,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586580666] [2025-01-09 11:31:39,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586580666] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:31:39,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859029393] [2025-01-09 11:31:39,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:39,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:31:39,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:31:39,942 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:31:39,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 11:31:40,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 11:31:40,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 11:31:40,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:40,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:40,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:31:40,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:31:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-01-09 11:31:40,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:31:40,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859029393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:40,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:31:40,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:31:40,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582802513] [2025-01-09 11:31:40,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:40,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:31:40,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:40,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:31:40,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:31:40,135 INFO L87 Difference]: Start difference. First operand has 114 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 80 states have internal predecessors, (113), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 11:31:40,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:40,155 INFO L93 Difference]: Finished difference Result 222 states and 381 transitions. [2025-01-09 11:31:40,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:31:40,156 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 215 [2025-01-09 11:31:40,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:40,160 INFO L225 Difference]: With dead ends: 222 [2025-01-09 11:31:40,160 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 11:31:40,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:31:40,164 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:40,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:31:40,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 11:31:40,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-01-09 11:31:40,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 11:31:40,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 172 transitions. [2025-01-09 11:31:40,192 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 172 transitions. Word has length 215 [2025-01-09 11:31:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:40,192 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 172 transitions. [2025-01-09 11:31:40,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 11:31:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2025-01-09 11:31:40,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 11:31:40,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:40,195 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:40,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 11:31:40,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 11:31:40,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:40,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:40,398 INFO L85 PathProgramCache]: Analyzing trace with hash 799807239, now seen corresponding path program 1 times [2025-01-09 11:31:40,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:40,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051938920] [2025-01-09 11:31:40,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:40,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:40,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 11:31:40,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 11:31:40,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:40,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:40,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:40,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051938920] [2025-01-09 11:31:40,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051938920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:40,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:40,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:31:40,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106939786] [2025-01-09 11:31:40,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:40,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:31:40,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:40,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:31:40,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:31:40,663 INFO L87 Difference]: Start difference. First operand 111 states and 172 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:40,713 INFO L93 Difference]: Finished difference Result 266 states and 415 transitions. [2025-01-09 11:31:40,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:31:40,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 215 [2025-01-09 11:31:40,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:40,716 INFO L225 Difference]: With dead ends: 266 [2025-01-09 11:31:40,716 INFO L226 Difference]: Without dead ends: 158 [2025-01-09 11:31:40,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:31:40,717 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 58 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:40,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 359 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:31:40,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-01-09 11:31:40,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 133. [2025-01-09 11:31:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 99 states have (on average 1.4545454545454546) internal successors, (144), 99 states have internal predecessors, (144), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 11:31:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 208 transitions. [2025-01-09 11:31:40,741 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 208 transitions. Word has length 215 [2025-01-09 11:31:40,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:40,743 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 208 transitions. [2025-01-09 11:31:40,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 208 transitions. [2025-01-09 11:31:40,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 11:31:40,748 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:40,748 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:40,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:31:40,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:40,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:40,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1509892409, now seen corresponding path program 1 times [2025-01-09 11:31:40,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:40,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443449470] [2025-01-09 11:31:40,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:40,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:40,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 11:31:40,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 11:31:40,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:40,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:41,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:41,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443449470] [2025-01-09 11:31:41,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443449470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:41,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:41,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 11:31:41,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485206926] [2025-01-09 11:31:41,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:41,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:31:41,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:41,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:31:41,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:31:41,636 INFO L87 Difference]: Start difference. First operand 133 states and 208 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:42,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:42,387 INFO L93 Difference]: Finished difference Result 564 states and 871 transitions. [2025-01-09 11:31:42,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 11:31:42,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 215 [2025-01-09 11:31:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:42,390 INFO L225 Difference]: With dead ends: 564 [2025-01-09 11:31:42,390 INFO L226 Difference]: Without dead ends: 434 [2025-01-09 11:31:42,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:31:42,392 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 415 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:42,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 727 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:31:42,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-01-09 11:31:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 155. [2025-01-09 11:31:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 121 states have (on average 1.4793388429752066) internal successors, (179), 121 states have internal predecessors, (179), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 11:31:42,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 243 transitions. [2025-01-09 11:31:42,410 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 243 transitions. Word has length 215 [2025-01-09 11:31:42,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:42,411 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 243 transitions. [2025-01-09 11:31:42,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:42,411 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 243 transitions. [2025-01-09 11:31:42,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 11:31:42,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:42,413 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:42,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:31:42,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:42,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:42,414 INFO L85 PathProgramCache]: Analyzing trace with hash -829834039, now seen corresponding path program 1 times [2025-01-09 11:31:42,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:42,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647329467] [2025-01-09 11:31:42,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:42,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:42,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 11:31:42,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 11:31:42,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:42,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:42,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:42,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647329467] [2025-01-09 11:31:42,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647329467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:42,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:42,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:31:42,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230337535] [2025-01-09 11:31:42,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:42,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:31:42,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:42,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:31:42,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:31:42,703 INFO L87 Difference]: Start difference. First operand 155 states and 243 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:43,433 INFO L93 Difference]: Finished difference Result 695 states and 1078 transitions. [2025-01-09 11:31:43,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 11:31:43,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 215 [2025-01-09 11:31:43,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:43,439 INFO L225 Difference]: With dead ends: 695 [2025-01-09 11:31:43,440 INFO L226 Difference]: Without dead ends: 543 [2025-01-09 11:31:43,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:31:43,443 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 596 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:43,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 634 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:31:43,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-01-09 11:31:43,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 312. [2025-01-09 11:31:43,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 245 states have (on average 1.4816326530612245) internal successors, (363), 245 states have internal predecessors, (363), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 11:31:43,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 491 transitions. [2025-01-09 11:31:43,499 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 491 transitions. Word has length 215 [2025-01-09 11:31:43,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:43,500 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 491 transitions. [2025-01-09 11:31:43,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:43,501 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 491 transitions. [2025-01-09 11:31:43,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-01-09 11:31:43,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:43,502 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:43,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:31:43,503 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:43,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:43,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1196726985, now seen corresponding path program 1 times [2025-01-09 11:31:43,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:43,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042083028] [2025-01-09 11:31:43,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:43,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:43,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 11:31:43,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 11:31:43,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:43,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:43,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:43,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042083028] [2025-01-09 11:31:43,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042083028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:43,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:43,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:31:43,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969528354] [2025-01-09 11:31:43,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:43,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:31:43,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:43,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:31:43,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:31:43,680 INFO L87 Difference]: Start difference. First operand 312 states and 491 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:43,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:43,857 INFO L93 Difference]: Finished difference Result 868 states and 1375 transitions. [2025-01-09 11:31:43,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:31:43,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 215 [2025-01-09 11:31:43,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:43,861 INFO L225 Difference]: With dead ends: 868 [2025-01-09 11:31:43,861 INFO L226 Difference]: Without dead ends: 559 [2025-01-09 11:31:43,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:31:43,863 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 318 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:43,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 321 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:31:43,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-01-09 11:31:43,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 399. [2025-01-09 11:31:43,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 332 states have (on average 1.5240963855421688) internal successors, (506), 332 states have internal predecessors, (506), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 11:31:43,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 634 transitions. [2025-01-09 11:31:43,898 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 634 transitions. Word has length 215 [2025-01-09 11:31:43,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:43,898 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 634 transitions. [2025-01-09 11:31:43,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 634 transitions. [2025-01-09 11:31:43,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 11:31:43,900 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:43,900 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:43,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:31:43,901 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:43,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:43,901 INFO L85 PathProgramCache]: Analyzing trace with hash 870170331, now seen corresponding path program 1 times [2025-01-09 11:31:43,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:43,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755169847] [2025-01-09 11:31:43,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:43,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:43,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 11:31:43,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 11:31:43,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:43,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:44,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:44,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755169847] [2025-01-09 11:31:44,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755169847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:44,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:44,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:31:44,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525627557] [2025-01-09 11:31:44,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:44,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:31:44,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:44,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:31:44,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:31:44,074 INFO L87 Difference]: Start difference. First operand 399 states and 634 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:44,362 INFO L93 Difference]: Finished difference Result 1545 states and 2431 transitions. [2025-01-09 11:31:44,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:31:44,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 216 [2025-01-09 11:31:44,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:44,368 INFO L225 Difference]: With dead ends: 1545 [2025-01-09 11:31:44,368 INFO L226 Difference]: Without dead ends: 1059 [2025-01-09 11:31:44,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:31:44,369 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 468 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:44,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 821 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:31:44,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2025-01-09 11:31:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 753. [2025-01-09 11:31:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 753 states, 620 states have (on average 1.4838709677419355) internal successors, (920), 620 states have internal predecessors, (920), 128 states have call successors, (128), 4 states have call predecessors, (128), 4 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 11:31:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1176 transitions. [2025-01-09 11:31:44,446 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1176 transitions. Word has length 216 [2025-01-09 11:31:44,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:44,447 INFO L471 AbstractCegarLoop]: Abstraction has 753 states and 1176 transitions. [2025-01-09 11:31:44,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:44,447 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1176 transitions. [2025-01-09 11:31:44,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 11:31:44,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:44,449 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:44,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 11:31:44,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:44,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:44,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2033157408, now seen corresponding path program 1 times [2025-01-09 11:31:44,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:44,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614418794] [2025-01-09 11:31:44,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:44,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:44,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 11:31:44,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 11:31:44,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:44,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:44,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:44,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614418794] [2025-01-09 11:31:44,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614418794] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:44,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:44,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:31:44,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240127313] [2025-01-09 11:31:44,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:44,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:31:44,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:44,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:31:44,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:31:44,563 INFO L87 Difference]: Start difference. First operand 753 states and 1176 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:44,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:44,785 INFO L93 Difference]: Finished difference Result 1811 states and 2817 transitions. [2025-01-09 11:31:44,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:31:44,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 216 [2025-01-09 11:31:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:44,791 INFO L225 Difference]: With dead ends: 1811 [2025-01-09 11:31:44,791 INFO L226 Difference]: Without dead ends: 1061 [2025-01-09 11:31:44,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:31:44,796 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 130 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:44,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 331 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:31:44,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2025-01-09 11:31:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 824. [2025-01-09 11:31:44,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 691 states have (on average 1.4833574529667148) internal successors, (1025), 691 states have internal predecessors, (1025), 128 states have call successors, (128), 4 states have call predecessors, (128), 4 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 11:31:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1281 transitions. [2025-01-09 11:31:44,911 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1281 transitions. Word has length 216 [2025-01-09 11:31:44,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:44,912 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1281 transitions. [2025-01-09 11:31:44,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:44,912 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1281 transitions. [2025-01-09 11:31:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 11:31:44,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:44,916 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:44,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 11:31:44,917 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:44,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:44,917 INFO L85 PathProgramCache]: Analyzing trace with hash -935268003, now seen corresponding path program 1 times [2025-01-09 11:31:44,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:44,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115469163] [2025-01-09 11:31:44,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:44,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:44,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 11:31:44,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 11:31:44,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:44,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:45,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:45,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115469163] [2025-01-09 11:31:45,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115469163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:45,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:45,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 11:31:45,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641126047] [2025-01-09 11:31:45,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:45,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:31:45,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:45,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:31:45,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:31:45,466 INFO L87 Difference]: Start difference. First operand 824 states and 1281 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:46,766 INFO L93 Difference]: Finished difference Result 2621 states and 4020 transitions. [2025-01-09 11:31:46,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 11:31:46,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 216 [2025-01-09 11:31:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:46,775 INFO L225 Difference]: With dead ends: 2621 [2025-01-09 11:31:46,775 INFO L226 Difference]: Without dead ends: 1800 [2025-01-09 11:31:46,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:31:46,777 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 672 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:46,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 1094 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 11:31:46,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2025-01-09 11:31:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 837. [2025-01-09 11:31:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 704 states have (on average 1.4815340909090908) internal successors, (1043), 704 states have internal predecessors, (1043), 128 states have call successors, (128), 4 states have call predecessors, (128), 4 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 11:31:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1299 transitions. [2025-01-09 11:31:46,846 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1299 transitions. Word has length 216 [2025-01-09 11:31:46,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:46,847 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1299 transitions. [2025-01-09 11:31:46,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:46,847 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1299 transitions. [2025-01-09 11:31:46,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-09 11:31:46,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:46,849 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:46,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 11:31:46,849 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:46,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:46,850 INFO L85 PathProgramCache]: Analyzing trace with hash 235442955, now seen corresponding path program 1 times [2025-01-09 11:31:46,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:46,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281244796] [2025-01-09 11:31:46,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:46,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:46,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 11:31:46,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 11:31:46,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:46,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:47,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:47,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:47,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281244796] [2025-01-09 11:31:47,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281244796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:47,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:47,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:31:47,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045424843] [2025-01-09 11:31:47,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:47,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:31:47,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:47,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:31:47,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:31:47,025 INFO L87 Difference]: Start difference. First operand 837 states and 1299 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:47,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:47,311 INFO L93 Difference]: Finished difference Result 2196 states and 3402 transitions. [2025-01-09 11:31:47,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:31:47,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 216 [2025-01-09 11:31:47,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:47,317 INFO L225 Difference]: With dead ends: 2196 [2025-01-09 11:31:47,317 INFO L226 Difference]: Without dead ends: 1362 [2025-01-09 11:31:47,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:31:47,319 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 316 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:47,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 564 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:31:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2025-01-09 11:31:47,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 908. [2025-01-09 11:31:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 775 states have (on average 1.486451612903226) internal successors, (1152), 775 states have internal predecessors, (1152), 128 states have call successors, (128), 4 states have call predecessors, (128), 4 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 11:31:47,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1408 transitions. [2025-01-09 11:31:47,401 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1408 transitions. Word has length 216 [2025-01-09 11:31:47,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:47,401 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1408 transitions. [2025-01-09 11:31:47,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:47,401 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1408 transitions. [2025-01-09 11:31:47,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 11:31:47,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:47,403 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:47,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 11:31:47,404 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:47,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:47,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1710647650, now seen corresponding path program 1 times [2025-01-09 11:31:47,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:47,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001479188] [2025-01-09 11:31:47,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:47,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:47,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 11:31:47,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 11:31:47,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:47,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:47,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:47,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001479188] [2025-01-09 11:31:47,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001479188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:47,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:47,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:31:47,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224181562] [2025-01-09 11:31:47,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:47,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:31:47,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:47,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:31:47,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:31:47,457 INFO L87 Difference]: Start difference. First operand 908 states and 1408 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:47,569 INFO L93 Difference]: Finished difference Result 2676 states and 4157 transitions. [2025-01-09 11:31:47,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:31:47,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 217 [2025-01-09 11:31:47,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:47,576 INFO L225 Difference]: With dead ends: 2676 [2025-01-09 11:31:47,576 INFO L226 Difference]: Without dead ends: 1771 [2025-01-09 11:31:47,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:31:47,578 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 163 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:47,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 494 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:31:47,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2025-01-09 11:31:47,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 938. [2025-01-09 11:31:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 805 states have (on average 1.4732919254658385) internal successors, (1186), 805 states have internal predecessors, (1186), 128 states have call successors, (128), 4 states have call predecessors, (128), 4 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 11:31:47,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1442 transitions. [2025-01-09 11:31:47,647 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1442 transitions. Word has length 217 [2025-01-09 11:31:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:47,647 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1442 transitions. [2025-01-09 11:31:47,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1442 transitions. [2025-01-09 11:31:47,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 11:31:47,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:47,656 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:47,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 11:31:47,656 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:47,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:47,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1123841636, now seen corresponding path program 1 times [2025-01-09 11:31:47,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:47,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441258688] [2025-01-09 11:31:47,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:47,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:47,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 11:31:47,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 11:31:47,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:47,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:48,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:48,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:48,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441258688] [2025-01-09 11:31:48,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441258688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:48,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:48,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 11:31:48,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022869231] [2025-01-09 11:31:48,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:48,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 11:31:48,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:48,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 11:31:48,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:31:48,311 INFO L87 Difference]: Start difference. First operand 938 states and 1442 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:49,288 INFO L93 Difference]: Finished difference Result 2482 states and 3695 transitions. [2025-01-09 11:31:49,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 11:31:49,289 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 217 [2025-01-09 11:31:49,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:49,294 INFO L225 Difference]: With dead ends: 2482 [2025-01-09 11:31:49,294 INFO L226 Difference]: Without dead ends: 1545 [2025-01-09 11:31:49,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2025-01-09 11:31:49,297 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 507 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:49,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1089 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:31:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2025-01-09 11:31:49,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 984. [2025-01-09 11:31:49,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 847 states have (on average 1.4592680047225501) internal successors, (1236), 847 states have internal predecessors, (1236), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 11:31:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1492 transitions. [2025-01-09 11:31:49,415 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1492 transitions. Word has length 217 [2025-01-09 11:31:49,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:49,415 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1492 transitions. [2025-01-09 11:31:49,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1492 transitions. [2025-01-09 11:31:49,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 11:31:49,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:49,419 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:49,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 11:31:49,419 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:49,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:49,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1572351494, now seen corresponding path program 1 times [2025-01-09 11:31:49,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:49,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521278783] [2025-01-09 11:31:49,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:49,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:49,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 11:31:49,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 11:31:49,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:49,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:49,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:49,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521278783] [2025-01-09 11:31:49,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521278783] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:49,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:49,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:31:49,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101366672] [2025-01-09 11:31:49,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:49,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:31:49,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:49,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:31:49,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:31:49,605 INFO L87 Difference]: Start difference. First operand 984 states and 1492 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:50,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:50,167 INFO L93 Difference]: Finished difference Result 2418 states and 3634 transitions. [2025-01-09 11:31:50,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 11:31:50,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 217 [2025-01-09 11:31:50,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:50,173 INFO L225 Difference]: With dead ends: 2418 [2025-01-09 11:31:50,173 INFO L226 Difference]: Without dead ends: 1437 [2025-01-09 11:31:50,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:31:50,175 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 291 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:50,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 615 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:31:50,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2025-01-09 11:31:50,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1053. [2025-01-09 11:31:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 916 states have (on average 1.453056768558952) internal successors, (1331), 916 states have internal predecessors, (1331), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 11:31:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1587 transitions. [2025-01-09 11:31:50,249 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1587 transitions. Word has length 217 [2025-01-09 11:31:50,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:50,249 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1587 transitions. [2025-01-09 11:31:50,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:50,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1587 transitions. [2025-01-09 11:31:50,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 11:31:50,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:50,251 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:50,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 11:31:50,251 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:50,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:50,251 INFO L85 PathProgramCache]: Analyzing trace with hash 588378160, now seen corresponding path program 1 times [2025-01-09 11:31:50,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:50,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192946973] [2025-01-09 11:31:50,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:50,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:50,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 11:31:50,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 11:31:50,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:50,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:50,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:50,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192946973] [2025-01-09 11:31:50,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192946973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:50,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:50,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 11:31:50,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629648621] [2025-01-09 11:31:50,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:50,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:31:50,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:50,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:31:50,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:31:50,623 INFO L87 Difference]: Start difference. First operand 1053 states and 1587 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 11:31:50,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:50,973 INFO L93 Difference]: Finished difference Result 2475 states and 3722 transitions. [2025-01-09 11:31:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:31:50,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 217 [2025-01-09 11:31:50,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:50,978 INFO L225 Difference]: With dead ends: 2475 [2025-01-09 11:31:50,978 INFO L226 Difference]: Without dead ends: 1425 [2025-01-09 11:31:50,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:31:50,981 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 171 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:50,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 869 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:31:50,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2025-01-09 11:31:51,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1416. [2025-01-09 11:31:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1245 states have (on average 1.448995983935743) internal successors, (1804), 1245 states have internal predecessors, (1804), 160 states have call successors, (160), 10 states have call predecessors, (160), 10 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2025-01-09 11:31:51,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2124 transitions. [2025-01-09 11:31:51,089 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2124 transitions. Word has length 217 [2025-01-09 11:31:51,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:51,089 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 2124 transitions. [2025-01-09 11:31:51,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 11:31:51,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2124 transitions. [2025-01-09 11:31:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 11:31:51,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:51,091 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:51,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 11:31:51,091 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:51,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:51,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1268436530, now seen corresponding path program 1 times [2025-01-09 11:31:51,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:51,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892705165] [2025-01-09 11:31:51,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:51,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:51,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 11:31:51,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 11:31:51,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:51,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:51,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:51,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892705165] [2025-01-09 11:31:51,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892705165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:51,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:51,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:31:51,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022325349] [2025-01-09 11:31:51,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:51,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:31:51,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:51,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:31:51,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:31:51,206 INFO L87 Difference]: Start difference. First operand 1416 states and 2124 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:51,603 INFO L93 Difference]: Finished difference Result 3140 states and 4699 transitions. [2025-01-09 11:31:51,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:31:51,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 217 [2025-01-09 11:31:51,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:51,610 INFO L225 Difference]: With dead ends: 3140 [2025-01-09 11:31:51,610 INFO L226 Difference]: Without dead ends: 1720 [2025-01-09 11:31:51,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:31:51,613 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 289 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:51,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 525 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:31:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2025-01-09 11:31:51,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1297. [2025-01-09 11:31:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 1160 states have (on average 1.45) internal successors, (1682), 1160 states have internal predecessors, (1682), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 11:31:51,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1938 transitions. [2025-01-09 11:31:51,711 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1938 transitions. Word has length 217 [2025-01-09 11:31:51,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:51,711 INFO L471 AbstractCegarLoop]: Abstraction has 1297 states and 1938 transitions. [2025-01-09 11:31:51,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1938 transitions. [2025-01-09 11:31:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 11:31:51,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:51,713 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:51,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 11:31:51,713 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:51,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:51,713 INFO L85 PathProgramCache]: Analyzing trace with hash 821804170, now seen corresponding path program 1 times [2025-01-09 11:31:51,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:51,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585727817] [2025-01-09 11:31:51,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:51,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:51,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 11:31:51,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 11:31:51,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:51,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:51,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:51,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585727817] [2025-01-09 11:31:51,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585727817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:51,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:51,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:31:51,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110985391] [2025-01-09 11:31:51,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:51,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:31:51,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:51,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:31:51,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:31:51,886 INFO L87 Difference]: Start difference. First operand 1297 states and 1938 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:52,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:52,274 INFO L93 Difference]: Finished difference Result 3214 states and 4784 transitions. [2025-01-09 11:31:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:31:52,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 217 [2025-01-09 11:31:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:52,281 INFO L225 Difference]: With dead ends: 3214 [2025-01-09 11:31:52,282 INFO L226 Difference]: Without dead ends: 1917 [2025-01-09 11:31:52,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:31:52,285 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 137 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:52,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 522 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:31:52,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2025-01-09 11:31:52,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1344. [2025-01-09 11:31:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1207 states have (on average 1.4589892294946147) internal successors, (1761), 1207 states have internal predecessors, (1761), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 11:31:52,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 2017 transitions. [2025-01-09 11:31:52,384 INFO L78 Accepts]: Start accepts. Automaton has 1344 states and 2017 transitions. Word has length 217 [2025-01-09 11:31:52,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:52,385 INFO L471 AbstractCegarLoop]: Abstraction has 1344 states and 2017 transitions. [2025-01-09 11:31:52,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:52,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1344 states and 2017 transitions. [2025-01-09 11:31:52,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 11:31:52,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:52,387 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:52,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 11:31:52,387 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:52,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:52,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1501862540, now seen corresponding path program 1 times [2025-01-09 11:31:52,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:52,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273694380] [2025-01-09 11:31:52,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:52,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:52,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 11:31:52,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 11:31:52,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:52,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:52,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:52,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273694380] [2025-01-09 11:31:52,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273694380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:52,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:52,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 11:31:52,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535140772] [2025-01-09 11:31:52,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:52,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:31:52,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:52,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:31:52,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:31:52,568 INFO L87 Difference]: Start difference. First operand 1344 states and 2017 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:53,176 INFO L93 Difference]: Finished difference Result 3080 states and 4598 transitions. [2025-01-09 11:31:53,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 11:31:53,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 217 [2025-01-09 11:31:53,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:53,183 INFO L225 Difference]: With dead ends: 3080 [2025-01-09 11:31:53,183 INFO L226 Difference]: Without dead ends: 1729 [2025-01-09 11:31:53,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:31:53,185 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 285 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:53,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 735 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:31:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2025-01-09 11:31:53,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1347. [2025-01-09 11:31:53,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1210 states have (on average 1.456198347107438) internal successors, (1762), 1210 states have internal predecessors, (1762), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 11:31:53,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 2018 transitions. [2025-01-09 11:31:53,276 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 2018 transitions. Word has length 217 [2025-01-09 11:31:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:53,277 INFO L471 AbstractCegarLoop]: Abstraction has 1347 states and 2018 transitions. [2025-01-09 11:31:53,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:53,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 2018 transitions. [2025-01-09 11:31:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 11:31:53,278 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:53,279 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:53,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 11:31:53,280 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:53,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:53,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2000571940, now seen corresponding path program 1 times [2025-01-09 11:31:53,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:53,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399735254] [2025-01-09 11:31:53,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:53,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:53,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 11:31:53,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 11:31:53,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:53,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:53,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:53,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399735254] [2025-01-09 11:31:53,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399735254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:53,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:53,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:31:53,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114520068] [2025-01-09 11:31:53,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:53,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:31:53,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:53,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:31:53,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:31:53,327 INFO L87 Difference]: Start difference. First operand 1347 states and 2018 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:53,432 INFO L93 Difference]: Finished difference Result 2949 states and 4371 transitions. [2025-01-09 11:31:53,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:31:53,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 217 [2025-01-09 11:31:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:53,438 INFO L225 Difference]: With dead ends: 2949 [2025-01-09 11:31:53,438 INFO L226 Difference]: Without dead ends: 1605 [2025-01-09 11:31:53,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:31:53,441 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 58 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:53,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 367 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:31:53,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2025-01-09 11:31:53,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1347. [2025-01-09 11:31:53,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1347 states, 1210 states have (on average 1.3991735537190082) internal successors, (1693), 1210 states have internal predecessors, (1693), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 11:31:53,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1949 transitions. [2025-01-09 11:31:53,532 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1949 transitions. Word has length 217 [2025-01-09 11:31:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:53,532 INFO L471 AbstractCegarLoop]: Abstraction has 1347 states and 1949 transitions. [2025-01-09 11:31:53,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1949 transitions. [2025-01-09 11:31:53,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 11:31:53,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:53,534 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:53,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 11:31:53,534 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:53,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:53,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1135136473, now seen corresponding path program 1 times [2025-01-09 11:31:53,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:53,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854733011] [2025-01-09 11:31:53,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:53,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:53,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 11:31:53,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 11:31:53,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:53,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:53,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:53,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854733011] [2025-01-09 11:31:53,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854733011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:53,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:53,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 11:31:53,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211436410] [2025-01-09 11:31:53,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:53,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:31:53,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:53,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:31:53,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:31:53,818 INFO L87 Difference]: Start difference. First operand 1347 states and 1949 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:54,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:54,422 INFO L93 Difference]: Finished difference Result 3197 states and 4619 transitions. [2025-01-09 11:31:54,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:31:54,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 217 [2025-01-09 11:31:54,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:54,430 INFO L225 Difference]: With dead ends: 3197 [2025-01-09 11:31:54,430 INFO L226 Difference]: Without dead ends: 1823 [2025-01-09 11:31:54,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:31:54,433 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 244 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:54,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 907 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:31:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2025-01-09 11:31:54,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1362. [2025-01-09 11:31:54,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1225 states have (on average 1.3951020408163266) internal successors, (1709), 1225 states have internal predecessors, (1709), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 11:31:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1965 transitions. [2025-01-09 11:31:54,536 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1965 transitions. Word has length 217 [2025-01-09 11:31:54,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:54,538 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1965 transitions. [2025-01-09 11:31:54,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1965 transitions. [2025-01-09 11:31:54,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 11:31:54,539 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:54,540 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:54,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 11:31:54,540 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:54,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:54,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1137300387, now seen corresponding path program 1 times [2025-01-09 11:31:54,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:54,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768290782] [2025-01-09 11:31:54,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:54,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:54,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 11:31:54,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 11:31:54,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:54,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:55,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:55,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768290782] [2025-01-09 11:31:55,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768290782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:55,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:55,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 11:31:55,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346712417] [2025-01-09 11:31:55,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:55,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 11:31:55,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:55,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 11:31:55,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:31:55,306 INFO L87 Difference]: Start difference. First operand 1362 states and 1965 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:56,256 INFO L93 Difference]: Finished difference Result 3487 states and 4901 transitions. [2025-01-09 11:31:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 11:31:56,257 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 218 [2025-01-09 11:31:56,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:56,270 INFO L225 Difference]: With dead ends: 3487 [2025-01-09 11:31:56,270 INFO L226 Difference]: Without dead ends: 2128 [2025-01-09 11:31:56,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2025-01-09 11:31:56,273 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 510 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:56,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1128 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 11:31:56,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2025-01-09 11:31:56,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 1386. [2025-01-09 11:31:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1249 states have (on average 1.3907125700560448) internal successors, (1737), 1249 states have internal predecessors, (1737), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 11:31:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1993 transitions. [2025-01-09 11:31:56,381 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1993 transitions. Word has length 218 [2025-01-09 11:31:56,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:56,384 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1993 transitions. [2025-01-09 11:31:56,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1993 transitions. [2025-01-09 11:31:56,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 11:31:56,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:56,391 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:56,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 11:31:56,391 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:56,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:56,394 INFO L85 PathProgramCache]: Analyzing trace with hash 532403193, now seen corresponding path program 1 times [2025-01-09 11:31:56,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:56,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533563189] [2025-01-09 11:31:56,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:56,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:56,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 11:31:56,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 11:31:56,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:56,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:56,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:56,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533563189] [2025-01-09 11:31:56,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533563189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:56,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:56,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:31:56,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596420930] [2025-01-09 11:31:56,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:56,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:31:56,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:56,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:31:56,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:31:56,853 INFO L87 Difference]: Start difference. First operand 1386 states and 1993 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:57,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:57,054 INFO L93 Difference]: Finished difference Result 3997 states and 5713 transitions. [2025-01-09 11:31:57,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:31:57,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 218 [2025-01-09 11:31:57,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:57,061 INFO L225 Difference]: With dead ends: 3997 [2025-01-09 11:31:57,061 INFO L226 Difference]: Without dead ends: 2567 [2025-01-09 11:31:57,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:31:57,063 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 295 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:57,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 380 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:31:57,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2025-01-09 11:31:57,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2554. [2025-01-09 11:31:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 2385 states have (on average 1.3958071278825996) internal successors, (3329), 2393 states have internal predecessors, (3329), 152 states have call successors, (152), 16 states have call predecessors, (152), 16 states have return successors, (152), 144 states have call predecessors, (152), 152 states have call successors, (152) [2025-01-09 11:31:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 3633 transitions. [2025-01-09 11:31:57,197 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 3633 transitions. Word has length 218 [2025-01-09 11:31:57,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:57,198 INFO L471 AbstractCegarLoop]: Abstraction has 2554 states and 3633 transitions. [2025-01-09 11:31:57,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:57,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 3633 transitions. [2025-01-09 11:31:57,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 11:31:57,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:57,200 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:57,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 11:31:57,200 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:57,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:57,201 INFO L85 PathProgramCache]: Analyzing trace with hash 69427383, now seen corresponding path program 1 times [2025-01-09 11:31:57,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:57,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787195036] [2025-01-09 11:31:57,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:57,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:57,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 11:31:57,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 11:31:57,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:57,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:57,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:57,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787195036] [2025-01-09 11:31:57,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787195036] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:57,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:57,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 11:31:57,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899831403] [2025-01-09 11:31:57,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:57,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:31:57,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:57,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:31:57,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:31:57,506 INFO L87 Difference]: Start difference. First operand 2554 states and 3633 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:31:58,207 INFO L93 Difference]: Finished difference Result 6152 states and 8569 transitions. [2025-01-09 11:31:58,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:31:58,210 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 218 [2025-01-09 11:31:58,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:31:58,217 INFO L225 Difference]: With dead ends: 6152 [2025-01-09 11:31:58,218 INFO L226 Difference]: Without dead ends: 3601 [2025-01-09 11:31:58,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:31:58,220 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 319 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:31:58,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1196 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:31:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3601 states. [2025-01-09 11:31:58,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3601 to 2675. [2025-01-09 11:31:58,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 2506 states have (on average 1.3874700718276138) internal successors, (3477), 2514 states have internal predecessors, (3477), 152 states have call successors, (152), 16 states have call predecessors, (152), 16 states have return successors, (152), 144 states have call predecessors, (152), 152 states have call successors, (152) [2025-01-09 11:31:58,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 3781 transitions. [2025-01-09 11:31:58,475 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 3781 transitions. Word has length 218 [2025-01-09 11:31:58,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:31:58,476 INFO L471 AbstractCegarLoop]: Abstraction has 2675 states and 3781 transitions. [2025-01-09 11:31:58,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:31:58,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 3781 transitions. [2025-01-09 11:31:58,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 11:31:58,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:31:58,478 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:31:58,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 11:31:58,479 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:31:58,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:31:58,479 INFO L85 PathProgramCache]: Analyzing trace with hash -711060160, now seen corresponding path program 1 times [2025-01-09 11:31:58,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:31:58,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140987419] [2025-01-09 11:31:58,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:31:58,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:31:58,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 11:31:58,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 11:31:58,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:31:58,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:31:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:31:58,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:31:58,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140987419] [2025-01-09 11:31:58,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140987419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:31:58,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:31:58,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 11:31:58,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007862458] [2025-01-09 11:31:58,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:31:58,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:31:58,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:31:58,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:31:58,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:31:58,920 INFO L87 Difference]: Start difference. First operand 2675 states and 3781 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:32:00,007 INFO L93 Difference]: Finished difference Result 6708 states and 9291 transitions. [2025-01-09 11:32:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 11:32:00,008 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 218 [2025-01-09 11:32:00,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:32:00,019 INFO L225 Difference]: With dead ends: 6708 [2025-01-09 11:32:00,019 INFO L226 Difference]: Without dead ends: 4036 [2025-01-09 11:32:00,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-01-09 11:32:00,024 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 494 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 11:32:00,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1233 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 11:32:00,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4036 states. [2025-01-09 11:32:00,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4036 to 2745. [2025-01-09 11:32:00,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2745 states, 2576 states have (on average 1.387810559006211) internal successors, (3575), 2584 states have internal predecessors, (3575), 152 states have call successors, (152), 16 states have call predecessors, (152), 16 states have return successors, (152), 144 states have call predecessors, (152), 152 states have call successors, (152) [2025-01-09 11:32:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2745 states to 2745 states and 3879 transitions. [2025-01-09 11:32:00,166 INFO L78 Accepts]: Start accepts. Automaton has 2745 states and 3879 transitions. Word has length 218 [2025-01-09 11:32:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:32:00,166 INFO L471 AbstractCegarLoop]: Abstraction has 2745 states and 3879 transitions. [2025-01-09 11:32:00,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:00,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2745 states and 3879 transitions. [2025-01-09 11:32:00,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 11:32:00,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:00,170 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:00,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 11:32:00,170 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:00,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash 807162807, now seen corresponding path program 1 times [2025-01-09 11:32:00,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:32:00,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325796588] [2025-01-09 11:32:00,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:00,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:32:00,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 11:32:00,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 11:32:00,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:00,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:32:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:32:00,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:32:00,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325796588] [2025-01-09 11:32:00,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325796588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:32:00,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:32:00,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 11:32:00,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174638742] [2025-01-09 11:32:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:32:00,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:32:00,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:32:00,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:32:00,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:32:00,401 INFO L87 Difference]: Start difference. First operand 2745 states and 3879 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:01,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:32:01,305 INFO L93 Difference]: Finished difference Result 7616 states and 10784 transitions. [2025-01-09 11:32:01,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:32:01,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 218 [2025-01-09 11:32:01,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:32:01,316 INFO L225 Difference]: With dead ends: 7616 [2025-01-09 11:32:01,316 INFO L226 Difference]: Without dead ends: 4874 [2025-01-09 11:32:01,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:32:01,321 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 293 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:32:01,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1308 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 11:32:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2025-01-09 11:32:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4393. [2025-01-09 11:32:01,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4393 states, 4088 states have (on average 1.385518590998043) internal successors, (5664), 4096 states have internal predecessors, (5664), 280 states have call successors, (280), 24 states have call predecessors, (280), 24 states have return successors, (280), 272 states have call predecessors, (280), 280 states have call successors, (280) [2025-01-09 11:32:01,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4393 states to 4393 states and 6224 transitions. [2025-01-09 11:32:01,587 INFO L78 Accepts]: Start accepts. Automaton has 4393 states and 6224 transitions. Word has length 218 [2025-01-09 11:32:01,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:32:01,587 INFO L471 AbstractCegarLoop]: Abstraction has 4393 states and 6224 transitions. [2025-01-09 11:32:01,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:01,587 INFO L276 IsEmpty]: Start isEmpty. Operand 4393 states and 6224 transitions. [2025-01-09 11:32:01,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 11:32:01,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:01,590 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:01,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 11:32:01,590 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:01,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:01,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1867353140, now seen corresponding path program 1 times [2025-01-09 11:32:01,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:32:01,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815864607] [2025-01-09 11:32:01,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:01,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:32:01,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 11:32:01,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 11:32:01,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:01,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:32:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:32:01,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:32:01,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815864607] [2025-01-09 11:32:01,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815864607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:32:01,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:32:01,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 11:32:01,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004263467] [2025-01-09 11:32:01,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:32:01,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 11:32:01,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:32:01,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 11:32:01,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:32:01,850 INFO L87 Difference]: Start difference. First operand 4393 states and 6224 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:02,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:32:02,670 INFO L93 Difference]: Finished difference Result 9838 states and 13665 transitions. [2025-01-09 11:32:02,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 11:32:02,671 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 219 [2025-01-09 11:32:02,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:32:02,683 INFO L225 Difference]: With dead ends: 9838 [2025-01-09 11:32:02,684 INFO L226 Difference]: Without dead ends: 6630 [2025-01-09 11:32:02,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2025-01-09 11:32:02,689 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 487 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:32:02,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1051 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 11:32:02,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6630 states. [2025-01-09 11:32:03,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6630 to 4448. [2025-01-09 11:32:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4448 states, 4143 states have (on average 1.388124547429399) internal successors, (5751), 4151 states have internal predecessors, (5751), 280 states have call successors, (280), 24 states have call predecessors, (280), 24 states have return successors, (280), 272 states have call predecessors, (280), 280 states have call successors, (280) [2025-01-09 11:32:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4448 states to 4448 states and 6311 transitions. [2025-01-09 11:32:03,063 INFO L78 Accepts]: Start accepts. Automaton has 4448 states and 6311 transitions. Word has length 219 [2025-01-09 11:32:03,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:32:03,063 INFO L471 AbstractCegarLoop]: Abstraction has 4448 states and 6311 transitions. [2025-01-09 11:32:03,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:03,063 INFO L276 IsEmpty]: Start isEmpty. Operand 4448 states and 6311 transitions. [2025-01-09 11:32:03,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 11:32:03,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:03,067 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:03,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 11:32:03,067 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:03,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:03,067 INFO L85 PathProgramCache]: Analyzing trace with hash 646914820, now seen corresponding path program 1 times [2025-01-09 11:32:03,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:32:03,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833518397] [2025-01-09 11:32:03,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:03,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:32:03,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 11:32:03,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 11:32:03,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:03,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:32:03,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:32:03,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:32:03,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833518397] [2025-01-09 11:32:03,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833518397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:32:03,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:32:03,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 11:32:03,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561792263] [2025-01-09 11:32:03,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:32:03,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:32:03,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:32:03,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:32:03,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:32:03,222 INFO L87 Difference]: Start difference. First operand 4448 states and 6311 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:03,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:32:03,974 INFO L93 Difference]: Finished difference Result 9810 states and 13930 transitions. [2025-01-09 11:32:03,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 11:32:03,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 219 [2025-01-09 11:32:03,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:32:03,985 INFO L225 Difference]: With dead ends: 9810 [2025-01-09 11:32:03,985 INFO L226 Difference]: Without dead ends: 5353 [2025-01-09 11:32:03,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:32:03,991 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 343 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:32:03,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 557 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:32:03,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5353 states. [2025-01-09 11:32:04,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5353 to 4435. [2025-01-09 11:32:04,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4435 states, 4130 states have (on average 1.3891041162227602) internal successors, (5737), 4138 states have internal predecessors, (5737), 280 states have call successors, (280), 24 states have call predecessors, (280), 24 states have return successors, (280), 272 states have call predecessors, (280), 280 states have call successors, (280) [2025-01-09 11:32:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4435 states to 4435 states and 6297 transitions. [2025-01-09 11:32:04,247 INFO L78 Accepts]: Start accepts. Automaton has 4435 states and 6297 transitions. Word has length 219 [2025-01-09 11:32:04,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:32:04,247 INFO L471 AbstractCegarLoop]: Abstraction has 4435 states and 6297 transitions. [2025-01-09 11:32:04,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:04,247 INFO L276 IsEmpty]: Start isEmpty. Operand 4435 states and 6297 transitions. [2025-01-09 11:32:04,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 11:32:04,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:04,250 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:04,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 11:32:04,250 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:04,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:04,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1413040475, now seen corresponding path program 1 times [2025-01-09 11:32:04,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:32:04,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778043469] [2025-01-09 11:32:04,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:04,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:32:04,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 11:32:04,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 11:32:04,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:04,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:32:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:32:04,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:32:04,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778043469] [2025-01-09 11:32:04,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778043469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:32:04,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:32:04,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:32:04,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233010351] [2025-01-09 11:32:04,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:32:04,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:32:04,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:32:04,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:32:04,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:32:04,311 INFO L87 Difference]: Start difference. First operand 4435 states and 6297 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:32:04,852 INFO L93 Difference]: Finished difference Result 12603 states and 18013 transitions. [2025-01-09 11:32:04,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:32:04,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 219 [2025-01-09 11:32:04,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:32:04,869 INFO L225 Difference]: With dead ends: 12603 [2025-01-09 11:32:04,869 INFO L226 Difference]: Without dead ends: 8171 [2025-01-09 11:32:04,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:32:04,877 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 192 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:32:04,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 750 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:32:04,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8171 states. [2025-01-09 11:32:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8171 to 6088. [2025-01-09 11:32:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6088 states, 5641 states have (on average 1.3887608580039) internal successors, (7834), 5651 states have internal predecessors, (7834), 412 states have call successors, (412), 34 states have call predecessors, (412), 34 states have return successors, (412), 402 states have call predecessors, (412), 412 states have call successors, (412) [2025-01-09 11:32:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6088 states to 6088 states and 8658 transitions. [2025-01-09 11:32:05,333 INFO L78 Accepts]: Start accepts. Automaton has 6088 states and 8658 transitions. Word has length 219 [2025-01-09 11:32:05,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:32:05,333 INFO L471 AbstractCegarLoop]: Abstraction has 6088 states and 8658 transitions. [2025-01-09 11:32:05,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:05,333 INFO L276 IsEmpty]: Start isEmpty. Operand 6088 states and 8658 transitions. [2025-01-09 11:32:05,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 11:32:05,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:05,337 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:05,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 11:32:05,338 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:05,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:05,339 INFO L85 PathProgramCache]: Analyzing trace with hash 683044820, now seen corresponding path program 1 times [2025-01-09 11:32:05,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:32:05,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691501196] [2025-01-09 11:32:05,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:05,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:32:05,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 11:32:05,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 11:32:05,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:05,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:32:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:32:05,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:32:05,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691501196] [2025-01-09 11:32:05,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691501196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:32:05,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:32:05,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 11:32:05,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828174088] [2025-01-09 11:32:05,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:32:05,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:32:05,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:32:05,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:32:05,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:32:05,598 INFO L87 Difference]: Start difference. First operand 6088 states and 8658 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:07,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:32:07,608 INFO L93 Difference]: Finished difference Result 12636 states and 17941 transitions. [2025-01-09 11:32:07,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 11:32:07,608 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 219 [2025-01-09 11:32:07,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:32:07,639 INFO L225 Difference]: With dead ends: 12636 [2025-01-09 11:32:07,639 INFO L226 Difference]: Without dead ends: 8843 [2025-01-09 11:32:07,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:32:07,645 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 513 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 11:32:07,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 1021 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 11:32:07,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8843 states. [2025-01-09 11:32:08,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8843 to 6142. [2025-01-09 11:32:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6142 states, 5695 states have (on average 1.3850746268656717) internal successors, (7888), 5705 states have internal predecessors, (7888), 412 states have call successors, (412), 34 states have call predecessors, (412), 34 states have return successors, (412), 402 states have call predecessors, (412), 412 states have call successors, (412) [2025-01-09 11:32:08,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6142 states to 6142 states and 8712 transitions. [2025-01-09 11:32:08,094 INFO L78 Accepts]: Start accepts. Automaton has 6142 states and 8712 transitions. Word has length 219 [2025-01-09 11:32:08,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:32:08,094 INFO L471 AbstractCegarLoop]: Abstraction has 6142 states and 8712 transitions. [2025-01-09 11:32:08,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 6142 states and 8712 transitions. [2025-01-09 11:32:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-09 11:32:08,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:08,097 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:08,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 11:32:08,098 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:08,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:08,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1114009450, now seen corresponding path program 1 times [2025-01-09 11:32:08,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:32:08,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763540379] [2025-01-09 11:32:08,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:08,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:32:08,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 11:32:08,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 11:32:08,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:08,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:32:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:32:08,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:32:08,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763540379] [2025-01-09 11:32:08,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763540379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:32:08,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:32:08,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:32:08,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276282874] [2025-01-09 11:32:08,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:32:08,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:32:08,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:32:08,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:32:08,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:32:08,253 INFO L87 Difference]: Start difference. First operand 6142 states and 8712 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:08,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:32:08,949 INFO L93 Difference]: Finished difference Result 11808 states and 16805 transitions. [2025-01-09 11:32:08,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 11:32:08,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 219 [2025-01-09 11:32:08,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:32:08,959 INFO L225 Difference]: With dead ends: 11808 [2025-01-09 11:32:08,960 INFO L226 Difference]: Without dead ends: 5665 [2025-01-09 11:32:08,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:32:08,966 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 204 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:32:08,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 711 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:32:08,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5665 states. [2025-01-09 11:32:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5665 to 5588. [2025-01-09 11:32:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5588 states, 5141 states have (on average 1.3831939311418011) internal successors, (7111), 5151 states have internal predecessors, (7111), 412 states have call successors, (412), 34 states have call predecessors, (412), 34 states have return successors, (412), 402 states have call predecessors, (412), 412 states have call successors, (412) [2025-01-09 11:32:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5588 states to 5588 states and 7935 transitions. [2025-01-09 11:32:09,326 INFO L78 Accepts]: Start accepts. Automaton has 5588 states and 7935 transitions. Word has length 219 [2025-01-09 11:32:09,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:32:09,327 INFO L471 AbstractCegarLoop]: Abstraction has 5588 states and 7935 transitions. [2025-01-09 11:32:09,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 5588 states and 7935 transitions. [2025-01-09 11:32:09,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 11:32:09,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:09,329 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:09,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 11:32:09,329 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:09,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:09,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1879185982, now seen corresponding path program 1 times [2025-01-09 11:32:09,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:32:09,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383783446] [2025-01-09 11:32:09,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:09,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:32:09,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 11:32:09,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 11:32:09,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:09,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:32:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:32:09,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:32:09,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383783446] [2025-01-09 11:32:09,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383783446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:32:09,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:32:09,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:32:09,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110089150] [2025-01-09 11:32:09,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:32:09,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:32:09,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:32:09,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:32:09,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:32:09,549 INFO L87 Difference]: Start difference. First operand 5588 states and 7935 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:10,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:32:10,621 INFO L93 Difference]: Finished difference Result 9508 states and 13507 transitions. [2025-01-09 11:32:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:32:10,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 220 [2025-01-09 11:32:10,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:32:10,634 INFO L225 Difference]: With dead ends: 9508 [2025-01-09 11:32:10,634 INFO L226 Difference]: Without dead ends: 6697 [2025-01-09 11:32:10,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:32:10,638 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 327 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:32:10,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 694 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:32:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6697 states. [2025-01-09 11:32:11,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6697 to 5472. [2025-01-09 11:32:11,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5472 states, 5025 states have (on average 1.3864676616915423) internal successors, (6967), 5035 states have internal predecessors, (6967), 412 states have call successors, (412), 34 states have call predecessors, (412), 34 states have return successors, (412), 402 states have call predecessors, (412), 412 states have call successors, (412) [2025-01-09 11:32:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5472 states to 5472 states and 7791 transitions. [2025-01-09 11:32:11,198 INFO L78 Accepts]: Start accepts. Automaton has 5472 states and 7791 transitions. Word has length 220 [2025-01-09 11:32:11,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:32:11,198 INFO L471 AbstractCegarLoop]: Abstraction has 5472 states and 7791 transitions. [2025-01-09 11:32:11,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:11,199 INFO L276 IsEmpty]: Start isEmpty. Operand 5472 states and 7791 transitions. [2025-01-09 11:32:11,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 11:32:11,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:11,201 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:11,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 11:32:11,201 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:11,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:11,201 INFO L85 PathProgramCache]: Analyzing trace with hash 496748414, now seen corresponding path program 1 times [2025-01-09 11:32:11,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:32:11,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532486347] [2025-01-09 11:32:11,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:11,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:32:11,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 11:32:11,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 11:32:11,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:11,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:32:11,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:32:11,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:32:11,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532486347] [2025-01-09 11:32:11,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532486347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:32:11,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:32:11,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 11:32:11,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889512592] [2025-01-09 11:32:11,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:32:11,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 11:32:11,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:32:11,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 11:32:11,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:32:11,426 INFO L87 Difference]: Start difference. First operand 5472 states and 7791 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:12,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:32:12,326 INFO L93 Difference]: Finished difference Result 11008 states and 15343 transitions. [2025-01-09 11:32:12,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 11:32:12,327 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 220 [2025-01-09 11:32:12,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:32:12,337 INFO L225 Difference]: With dead ends: 11008 [2025-01-09 11:32:12,337 INFO L226 Difference]: Without dead ends: 7277 [2025-01-09 11:32:12,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:32:12,343 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 362 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:32:12,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1294 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:32:12,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7277 states. [2025-01-09 11:32:12,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7277 to 5379. [2025-01-09 11:32:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5379 states, 4932 states have (on average 1.384022708840227) internal successors, (6826), 4942 states have internal predecessors, (6826), 412 states have call successors, (412), 34 states have call predecessors, (412), 34 states have return successors, (412), 402 states have call predecessors, (412), 412 states have call successors, (412) [2025-01-09 11:32:12,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5379 states to 5379 states and 7650 transitions. [2025-01-09 11:32:12,796 INFO L78 Accepts]: Start accepts. Automaton has 5379 states and 7650 transitions. Word has length 220 [2025-01-09 11:32:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:32:12,796 INFO L471 AbstractCegarLoop]: Abstraction has 5379 states and 7650 transitions. [2025-01-09 11:32:12,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:12,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5379 states and 7650 transitions. [2025-01-09 11:32:12,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 11:32:12,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:12,798 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:12,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 11:32:12,799 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:12,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:12,799 INFO L85 PathProgramCache]: Analyzing trace with hash -210805880, now seen corresponding path program 1 times [2025-01-09 11:32:12,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:32:12,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934910607] [2025-01-09 11:32:12,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:12,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:32:12,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 11:32:12,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 11:32:12,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:12,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:32:14,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:32:14,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:32:14,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934910607] [2025-01-09 11:32:14,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934910607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:32:14,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:32:14,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 11:32:14,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029929518] [2025-01-09 11:32:14,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:32:14,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 11:32:14,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:32:14,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 11:32:14,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 11:32:14,080 INFO L87 Difference]: Start difference. First operand 5379 states and 7650 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:16,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:32:16,447 INFO L93 Difference]: Finished difference Result 10740 states and 14847 transitions. [2025-01-09 11:32:16,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 11:32:16,448 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 220 [2025-01-09 11:32:16,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:32:16,457 INFO L225 Difference]: With dead ends: 10740 [2025-01-09 11:32:16,457 INFO L226 Difference]: Without dead ends: 8120 [2025-01-09 11:32:16,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2025-01-09 11:32:16,461 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 686 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:32:16,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 1945 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1937 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 11:32:16,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8120 states. [2025-01-09 11:32:16,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8120 to 5387. [2025-01-09 11:32:16,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5387 states, 4940 states have (on average 1.3850202429149798) internal successors, (6842), 4950 states have internal predecessors, (6842), 412 states have call successors, (412), 34 states have call predecessors, (412), 34 states have return successors, (412), 402 states have call predecessors, (412), 412 states have call successors, (412) [2025-01-09 11:32:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5387 states to 5387 states and 7666 transitions. [2025-01-09 11:32:16,871 INFO L78 Accepts]: Start accepts. Automaton has 5387 states and 7666 transitions. Word has length 220 [2025-01-09 11:32:16,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:32:16,871 INFO L471 AbstractCegarLoop]: Abstraction has 5387 states and 7666 transitions. [2025-01-09 11:32:16,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 5387 states and 7666 transitions. [2025-01-09 11:32:16,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 11:32:16,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:16,875 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:16,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 11:32:16,875 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:16,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:16,875 INFO L85 PathProgramCache]: Analyzing trace with hash 211895946, now seen corresponding path program 1 times [2025-01-09 11:32:16,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:32:16,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952030536] [2025-01-09 11:32:16,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:16,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:32:16,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 11:32:16,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 11:32:16,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:16,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:32:17,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:32:17,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:32:17,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952030536] [2025-01-09 11:32:17,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952030536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:32:17,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:32:17,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 11:32:17,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258396338] [2025-01-09 11:32:17,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:32:17,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:32:17,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:32:17,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:32:17,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:32:17,122 INFO L87 Difference]: Start difference. First operand 5387 states and 7666 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:32:18,904 INFO L93 Difference]: Finished difference Result 10507 states and 14973 transitions. [2025-01-09 11:32:18,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 11:32:18,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 220 [2025-01-09 11:32:18,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:32:18,915 INFO L225 Difference]: With dead ends: 10507 [2025-01-09 11:32:18,915 INFO L226 Difference]: Without dead ends: 6861 [2025-01-09 11:32:18,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-01-09 11:32:18,919 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 547 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 11:32:18,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1331 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 11:32:18,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6861 states. [2025-01-09 11:32:19,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6861 to 5387. [2025-01-09 11:32:19,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5387 states, 4940 states have (on average 1.3842105263157896) internal successors, (6838), 4950 states have internal predecessors, (6838), 412 states have call successors, (412), 34 states have call predecessors, (412), 34 states have return successors, (412), 402 states have call predecessors, (412), 412 states have call successors, (412) [2025-01-09 11:32:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5387 states to 5387 states and 7662 transitions. [2025-01-09 11:32:19,414 INFO L78 Accepts]: Start accepts. Automaton has 5387 states and 7662 transitions. Word has length 220 [2025-01-09 11:32:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:32:19,415 INFO L471 AbstractCegarLoop]: Abstraction has 5387 states and 7662 transitions. [2025-01-09 11:32:19,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:19,415 INFO L276 IsEmpty]: Start isEmpty. Operand 5387 states and 7662 transitions. [2025-01-09 11:32:19,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 11:32:19,417 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:19,417 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:19,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 11:32:19,417 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:19,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:19,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1746754322, now seen corresponding path program 1 times [2025-01-09 11:32:19,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:32:19,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615217646] [2025-01-09 11:32:19,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:19,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:32:19,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 11:32:19,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 11:32:19,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:19,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:32:20,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:32:20,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:32:20,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615217646] [2025-01-09 11:32:20,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615217646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:32:20,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:32:20,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 11:32:20,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543374161] [2025-01-09 11:32:20,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:32:20,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:32:20,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:32:20,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:32:20,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:32:20,108 INFO L87 Difference]: Start difference. First operand 5387 states and 7662 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:20,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:32:20,806 INFO L93 Difference]: Finished difference Result 7404 states and 10519 transitions. [2025-01-09 11:32:20,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 11:32:20,807 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 220 [2025-01-09 11:32:20,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:32:20,815 INFO L225 Difference]: With dead ends: 7404 [2025-01-09 11:32:20,815 INFO L226 Difference]: Without dead ends: 5411 [2025-01-09 11:32:20,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:32:20,817 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 103 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:32:20,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 732 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:32:20,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5411 states. [2025-01-09 11:32:21,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5411 to 5403. [2025-01-09 11:32:21,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5403 states, 4952 states have (on average 1.381663974151858) internal successors, (6842), 4962 states have internal predecessors, (6842), 412 states have call successors, (412), 38 states have call predecessors, (412), 38 states have return successors, (412), 402 states have call predecessors, (412), 412 states have call successors, (412) [2025-01-09 11:32:21,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5403 states to 5403 states and 7666 transitions. [2025-01-09 11:32:21,353 INFO L78 Accepts]: Start accepts. Automaton has 5403 states and 7666 transitions. Word has length 220 [2025-01-09 11:32:21,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:32:21,354 INFO L471 AbstractCegarLoop]: Abstraction has 5403 states and 7666 transitions. [2025-01-09 11:32:21,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:21,354 INFO L276 IsEmpty]: Start isEmpty. Operand 5403 states and 7666 transitions. [2025-01-09 11:32:21,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 11:32:21,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:21,357 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:21,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 11:32:21,357 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:21,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:21,358 INFO L85 PathProgramCache]: Analyzing trace with hash 309573755, now seen corresponding path program 1 times [2025-01-09 11:32:21,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:32:21,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376250987] [2025-01-09 11:32:21,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:21,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:32:21,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 11:32:21,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 11:32:21,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:21,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:32:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:32:21,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:32:21,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376250987] [2025-01-09 11:32:21,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376250987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:32:21,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:32:21,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 11:32:21,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844232631] [2025-01-09 11:32:21,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:32:21,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 11:32:21,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:32:21,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 11:32:21,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:32:21,692 INFO L87 Difference]: Start difference. First operand 5403 states and 7666 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:22,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:32:22,456 INFO L93 Difference]: Finished difference Result 10874 states and 15112 transitions. [2025-01-09 11:32:22,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 11:32:22,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 220 [2025-01-09 11:32:22,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:32:22,467 INFO L225 Difference]: With dead ends: 10874 [2025-01-09 11:32:22,468 INFO L226 Difference]: Without dead ends: 7212 [2025-01-09 11:32:22,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:32:22,473 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 174 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:32:22,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 800 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:32:22,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7212 states. [2025-01-09 11:32:23,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7212 to 5403. [2025-01-09 11:32:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5403 states, 4952 states have (on average 1.381663974151858) internal successors, (6842), 4962 states have internal predecessors, (6842), 412 states have call successors, (412), 38 states have call predecessors, (412), 38 states have return successors, (412), 402 states have call predecessors, (412), 412 states have call successors, (412) [2025-01-09 11:32:23,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5403 states to 5403 states and 7666 transitions. [2025-01-09 11:32:23,060 INFO L78 Accepts]: Start accepts. Automaton has 5403 states and 7666 transitions. Word has length 220 [2025-01-09 11:32:23,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:32:23,060 INFO L471 AbstractCegarLoop]: Abstraction has 5403 states and 7666 transitions. [2025-01-09 11:32:23,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:23,060 INFO L276 IsEmpty]: Start isEmpty. Operand 5403 states and 7666 transitions. [2025-01-09 11:32:23,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 11:32:23,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:23,063 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:23,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 11:32:23,063 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:23,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:23,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1543349309, now seen corresponding path program 1 times [2025-01-09 11:32:23,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:32:23,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571730279] [2025-01-09 11:32:23,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:23,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:32:23,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 11:32:23,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 11:32:23,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:23,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:32:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:32:23,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:32:23,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571730279] [2025-01-09 11:32:23,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571730279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:32:23,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:32:23,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:32:23,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277177124] [2025-01-09 11:32:23,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:32:23,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:32:23,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:32:23,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:32:23,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:32:23,140 INFO L87 Difference]: Start difference. First operand 5403 states and 7666 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:23,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:32:23,943 INFO L93 Difference]: Finished difference Result 11799 states and 16732 transitions. [2025-01-09 11:32:23,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:32:23,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 220 [2025-01-09 11:32:23,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:32:23,955 INFO L225 Difference]: With dead ends: 11799 [2025-01-09 11:32:23,955 INFO L226 Difference]: Without dead ends: 6399 [2025-01-09 11:32:23,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:32:23,962 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 119 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:32:23,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 419 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:32:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6399 states. [2025-01-09 11:32:24,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6399 to 5365. [2025-01-09 11:32:24,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5365 states, 4914 states have (on average 1.3776963776963778) internal successors, (6770), 4924 states have internal predecessors, (6770), 412 states have call successors, (412), 38 states have call predecessors, (412), 38 states have return successors, (412), 402 states have call predecessors, (412), 412 states have call successors, (412) [2025-01-09 11:32:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5365 states to 5365 states and 7594 transitions. [2025-01-09 11:32:24,425 INFO L78 Accepts]: Start accepts. Automaton has 5365 states and 7594 transitions. Word has length 220 [2025-01-09 11:32:24,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:32:24,426 INFO L471 AbstractCegarLoop]: Abstraction has 5365 states and 7594 transitions. [2025-01-09 11:32:24,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 5365 states and 7594 transitions. [2025-01-09 11:32:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 11:32:24,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:24,428 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:24,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 11:32:24,428 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:24,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:24,428 INFO L85 PathProgramCache]: Analyzing trace with hash -720724016, now seen corresponding path program 1 times [2025-01-09 11:32:24,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:32:24,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36924946] [2025-01-09 11:32:24,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:24,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:32:24,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 11:32:24,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 11:32:24,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:24,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:32:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:32:24,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:32:24,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36924946] [2025-01-09 11:32:24,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36924946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:32:24,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:32:24,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:32:24,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115772999] [2025-01-09 11:32:24,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:32:24,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:32:24,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:32:24,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:32:24,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:32:24,470 INFO L87 Difference]: Start difference. First operand 5365 states and 7594 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:25,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:32:25,322 INFO L93 Difference]: Finished difference Result 11403 states and 16146 transitions. [2025-01-09 11:32:25,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:32:25,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 220 [2025-01-09 11:32:25,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:32:25,332 INFO L225 Difference]: With dead ends: 11403 [2025-01-09 11:32:25,333 INFO L226 Difference]: Without dead ends: 6021 [2025-01-09 11:32:25,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:32:25,336 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 135 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:32:25,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 343 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:32:25,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6021 states. [2025-01-09 11:32:25,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6021 to 4790. [2025-01-09 11:32:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4790 states, 4339 states have (on average 1.357455634938926) internal successors, (5890), 4349 states have internal predecessors, (5890), 412 states have call successors, (412), 38 states have call predecessors, (412), 38 states have return successors, (412), 402 states have call predecessors, (412), 412 states have call successors, (412) [2025-01-09 11:32:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4790 states to 4790 states and 6714 transitions. [2025-01-09 11:32:25,808 INFO L78 Accepts]: Start accepts. Automaton has 4790 states and 6714 transitions. Word has length 220 [2025-01-09 11:32:25,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:32:25,808 INFO L471 AbstractCegarLoop]: Abstraction has 4790 states and 6714 transitions. [2025-01-09 11:32:25,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:25,808 INFO L276 IsEmpty]: Start isEmpty. Operand 4790 states and 6714 transitions. [2025-01-09 11:32:25,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 11:32:25,810 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:25,810 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:25,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 11:32:25,810 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:25,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:25,810 INFO L85 PathProgramCache]: Analyzing trace with hash 967399039, now seen corresponding path program 1 times [2025-01-09 11:32:25,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:32:25,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156705836] [2025-01-09 11:32:25,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:25,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:32:25,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 11:32:25,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 11:32:25,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:25,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:32:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:32:25,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:32:25,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156705836] [2025-01-09 11:32:25,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156705836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:32:25,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:32:25,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:32:25,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940213103] [2025-01-09 11:32:25,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:32:25,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:32:25,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:32:25,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:32:25,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:32:25,917 INFO L87 Difference]: Start difference. First operand 4790 states and 6714 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:26,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:32:26,740 INFO L93 Difference]: Finished difference Result 8721 states and 12312 transitions. [2025-01-09 11:32:26,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:32:26,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 220 [2025-01-09 11:32:26,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:32:26,750 INFO L225 Difference]: With dead ends: 8721 [2025-01-09 11:32:26,750 INFO L226 Difference]: Without dead ends: 5098 [2025-01-09 11:32:26,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:32:26,754 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 335 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:32:26,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 529 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:32:26,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5098 states. [2025-01-09 11:32:27,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5098 to 4337. [2025-01-09 11:32:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4337 states, 3886 states have (on average 1.357694287184766) internal successors, (5276), 3896 states have internal predecessors, (5276), 412 states have call successors, (412), 38 states have call predecessors, (412), 38 states have return successors, (412), 402 states have call predecessors, (412), 412 states have call successors, (412) [2025-01-09 11:32:27,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4337 states to 4337 states and 6100 transitions. [2025-01-09 11:32:27,353 INFO L78 Accepts]: Start accepts. Automaton has 4337 states and 6100 transitions. Word has length 220 [2025-01-09 11:32:27,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:32:27,354 INFO L471 AbstractCegarLoop]: Abstraction has 4337 states and 6100 transitions. [2025-01-09 11:32:27,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 4337 states and 6100 transitions. [2025-01-09 11:32:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 11:32:27,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:27,356 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:27,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 11:32:27,357 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:27,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2040892946, now seen corresponding path program 1 times [2025-01-09 11:32:27,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:32:27,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704877998] [2025-01-09 11:32:27,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:27,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:32:27,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 11:32:27,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 11:32:27,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:27,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:32:27,396 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 11:32:27,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 11:32:27,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 11:32:27,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:27,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:32:27,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 11:32:27,507 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 11:32:27,507 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 11:32:27,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 11:32:27,511 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:27,636 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 11:32:27,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:32:27 BoogieIcfgContainer [2025-01-09 11:32:27,640 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 11:32:27,641 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 11:32:27,641 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 11:32:27,641 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 11:32:27,641 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:31:39" (3/4) ... [2025-01-09 11:32:27,643 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 11:32:27,643 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 11:32:27,644 INFO L158 Benchmark]: Toolchain (without parser) took 48998.75ms. Allocated memory was 545.3MB in the beginning and 1.4GB in the end (delta: 880.8MB). Free memory was 514.0MB in the beginning and 989.8MB in the end (delta: -475.8MB). Peak memory consumption was 407.7MB. Max. memory is 16.1GB. [2025-01-09 11:32:27,645 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 126.0MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:32:27,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.10ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 94.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 11:32:27,645 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.42ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 89.3MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:32:27,646 INFO L158 Benchmark]: Boogie Preprocessor took 60.28ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 83.8MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:32:27,646 INFO L158 Benchmark]: RCFGBuilder took 537.65ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 52.5MB in the end (delta: 31.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 11:32:27,646 INFO L158 Benchmark]: TraceAbstraction took 48041.52ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 51.5MB in the beginning and 990.2MB in the end (delta: -938.7MB). Peak memory consumption was 349.0MB. Max. memory is 16.1GB. [2025-01-09 11:32:27,646 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 1.4GB. Free memory was 990.2MB in the beginning and 989.8MB in the end (delta: 369.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 11:32:27,646 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 201.3MB. Free memory was 126.3MB in the beginning and 126.0MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.10ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 94.5MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.42ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 89.3MB in the end (delta: 5.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.28ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 83.8MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 537.65ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 52.5MB in the end (delta: 31.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 48041.52ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 51.5MB in the beginning and 990.2MB in the end (delta: -938.7MB). Peak memory consumption was 349.0MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 1.4GB. Free memory was 990.2MB in the beginning and 989.8MB in the end (delta: 369.3kB). Peak memory consumption was 8.4MB. 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 206, overapproximation of someUnaryDOUBLEoperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 206, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 161, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 181, overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 167. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] unsigned char var_1_33 = 8; [L44] unsigned char var_1_38 = 8; [L45] unsigned char var_1_39 = 10; [L46] double var_1_40 = 8.35; [L47] double var_1_41 = 63.75; [L48] double var_1_42 = -0.125; [L49] double var_1_43 = -0.8; [L50] double var_1_44 = -0.5; [L51] unsigned short int var_1_45 = 50; [L52] unsigned char var_1_46 = 0; [L53] unsigned char var_1_47 = 5; [L54] unsigned char var_1_48 = 1; [L55] signed char var_1_49 = -16; [L56] signed char var_1_50 = 2; [L57] signed char var_1_51 = 16; [L58] signed char var_1_52 = 0; [L59] signed long int var_1_53 = 256; [L60] double var_1_54 = 1.25; [L61] unsigned long int var_1_55 = 5; [L62] signed long int last_1_var_1_1 = 64; [L63] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L210] isInitial = 1 [L211] FCALL initially() [L213] CALL updateLastVariables() [L202] last_1_var_1_1 = var_1_1 [L203] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L213] RET updateLastVariables() [L214] CALL updateVariables() [L147] var_1_7 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L148] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5] [L149] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L149] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L150] var_1_15 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L151] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L152] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L152] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L153] var_1_16 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L154] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L156] var_1_18 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L157] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L158] var_1_19 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_19 >= 0.0F && 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_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L159] RET assume_abort_if_not((var_1_19 >= 0.0F && 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_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L160] var_1_20 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L161] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L162] var_1_21 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_21 >= 0.0F && 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_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] RET assume_abort_if_not((var_1_21 >= 0.0F && 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_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L164] var_1_22 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L165] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] var_1_23 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L167] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L168] var_1_27 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L171] var_1_28 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L174] var_1_38 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L176] CALL assume_abort_if_not(var_1_38 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L176] RET assume_abort_if_not(var_1_38 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=10, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L177] var_1_39 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L178] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L179] CALL assume_abort_if_not(var_1_39 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L179] RET assume_abort_if_not(var_1_39 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_41=255/4, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L180] var_1_41 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L181] RET assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L182] var_1_42 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L183] RET assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L184] var_1_43 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L185] RET assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L186] var_1_44 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_44 >= -461168.6018427382800e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L187] RET assume_abort_if_not((var_1_44 >= -461168.6018427382800e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L188] var_1_47 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_47 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L189] RET assume_abort_if_not(var_1_47 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] CALL assume_abort_if_not(var_1_47 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] RET assume_abort_if_not(var_1_47 <= 127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L191] var_1_50 = __VERIFIER_nondet_char() [L192] CALL assume_abort_if_not(var_1_50 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L192] RET assume_abort_if_not(var_1_50 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L193] CALL assume_abort_if_not(var_1_50 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L193] RET assume_abort_if_not(var_1_50 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=16, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L194] var_1_51 = __VERIFIER_nondet_char() [L195] CALL assume_abort_if_not(var_1_51 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L195] RET assume_abort_if_not(var_1_51 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L196] CALL assume_abort_if_not(var_1_51 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L196] RET assume_abort_if_not(var_1_51 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L197] var_1_52 = __VERIFIER_nondet_char() [L198] CALL assume_abort_if_not(var_1_52 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L198] RET assume_abort_if_not(var_1_52 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L199] CALL assume_abort_if_not(var_1_52 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L199] RET assume_abort_if_not(var_1_52 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L214] RET updateVariables() [L215] CALL step() [L67] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L68] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L71] var_1_31 = var_1_13 [L72] var_1_55 = var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=1, var_1_7=0] [L73] COND FALSE !(\read(var_1_7)) [L76] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=1, var_1_7=0] [L78] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=1, var_1_7=0] [L81] COND FALSE !(var_1_44 > (var_1_43 + var_1_41)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=1, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=5/4, var_1_55=1, var_1_7=0] [L88] var_1_48 = var_1_39 [L89] var_1_32 = var_1_16 [L90] var_1_54 = var_1_44 [L91] var_1_30 = var_1_32 [L92] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_44=505, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=505, var_1_55=1, var_1_7=0] [L93] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_44=505, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=505, var_1_55=1, var_1_7=0] [L93] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L94] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=167/20, var_1_44=505, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=505, var_1_55=1, var_1_7=0] [L96] COND TRUE (-32 & var_1_38) > var_1_1 [L97] var_1_40 = ((((var_1_41) > (var_1_42)) ? (var_1_41) : (var_1_42))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=505, var_1_55=1, var_1_7=0] [L101] COND FALSE !(var_1_44 >= ((((var_1_41) < 0 ) ? -(var_1_41) : (var_1_41)))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=50, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=505, var_1_55=1, var_1_7=0] [L108] COND TRUE var_1_44 <= (var_1_29 + var_1_43) [L109] var_1_45 = var_1_31 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=64, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=-16, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=505, var_1_55=1, var_1_7=0] [L112] COND TRUE var_1_41 < var_1_29 [L113] var_1_49 = ((var_1_50 - var_1_51) + var_1_52) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=64, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=63, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=505, var_1_55=1, var_1_7=0] [L117] COND TRUE var_1_11 >= var_1_30 [L118] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=64, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=63, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=256, var_1_54=505, var_1_55=1, var_1_7=0] [L120] var_1_53 = var_1_26 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=64, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=63, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=126, var_1_54=505, var_1_55=1, var_1_7=0] [L121] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=64, var_1_22=507, var_1_24=10, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=64, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=63, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=126, var_1_54=505, var_1_55=1, var_1_7=0] [L121] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L122] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=252, var_1_22=507, var_1_24=10, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=64, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=63, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=126, var_1_54=505, var_1_55=1, var_1_7=0] [L130] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=252, var_1_22=507, var_1_24=10, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=64, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=63, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=126, var_1_54=505, var_1_55=1, var_1_7=0] [L131] COND TRUE ! var_1_7 [L132] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=252, var_1_22=507, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=64, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=63, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=126, var_1_54=505, var_1_55=1, var_1_7=0] [L140] EXPR var_1_11 ^ var_1_24 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=252, var_1_22=507, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=64, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=63, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=126, var_1_54=505, var_1_55=1, var_1_7=0] [L140] EXPR var_1_13 | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=252, var_1_22=507, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=64, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=63, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=126, var_1_54=505, var_1_55=1, var_1_7=0] [L140] COND TRUE (var_1_11 ^ var_1_24) < (var_1_13 | var_1_30) [L141] var_1_33 = ((((var_1_38) > (var_1_39)) ? (var_1_38) : (var_1_39))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=252, var_1_22=507, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=64, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=63, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=126, var_1_54=505, var_1_55=1, var_1_7=0] [L215] RET step() [L216] CALL, EXPR property() [L206] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=252, var_1_22=507, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=64, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=63, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=126, var_1_54=505, var_1_55=1, var_1_7=0] [L206] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=252, var_1_22=507, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=64, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=63, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=126, var_1_54=505, var_1_55=1, var_1_7=0] [L206] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=252, var_1_22=507, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=64, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=63, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=126, var_1_54=505, var_1_55=1, var_1_7=0] [L206] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=252, var_1_22=507, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=64, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=63, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=126, var_1_54=505, var_1_55=1, var_1_7=0] [L206-L207] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L216] RET, EXPR property() [L216] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=252, var_1_22=507, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=64, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=63, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=126, var_1_54=505, var_1_55=1, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=254, var_1_16=0, var_1_17=507, var_1_1=252, var_1_22=507, var_1_24=-64, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=254, var_1_38=-2, var_1_39=-2, var_1_40=506, var_1_41=506, var_1_42=506, var_1_44=505, var_1_45=64, var_1_46=0, var_1_47=0, var_1_48=-2, var_1_49=63, var_1_50=63, var_1_51=0, var_1_52=0, var_1_53=126, var_1_54=505, var_1_55=1, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.9s, OverallIterations: 38, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 27.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11556 SdHoareTripleChecker+Valid, 13.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11556 mSDsluCounter, 28568 SdHoareTripleChecker+Invalid, 11.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18429 mSDsCounter, 2082 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14738 IncrementalHoareTripleChecker+Invalid, 16820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2082 mSolverCounterUnsat, 10139 mSDtfsCounter, 14738 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 617 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6142occurred in iteration=27, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.6s AutomataMinimizationTime, 37 MinimizatonAttempts, 30126 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 8492 NumberOfCodeBlocks, 8492 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 8234 ConstructedInterpolants, 0 QuantifiedInterpolants, 24659 SizeOfPredicates, 0 NumberOfNonLiveVariables, 511 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 38 InterpolantComputations, 37 PerfectInterpolantSequences, 75330/75392 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 11:32:27,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-63.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8d684ebe960d17f15dd8c83d8cf3e676853b2b7a1cdec8ea8ac85aafe28041c6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:32:29,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:32:29,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 11:32:29,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:32:29,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:32:29,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:32:29,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:32:29,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:32:29,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:32:29,743 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:32:29,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:32:29,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:32:29,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:32:29,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:32:29,744 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:32:29,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:32:29,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:32:29,744 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:32:29,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:32:29,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:32:29,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:32:29,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:32:29,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:32:29,745 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 11:32:29,745 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 11:32:29,745 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 11:32:29,745 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:32:29,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:32:29,745 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:32:29,745 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:32:29,745 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:32:29,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:32:29,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:32:29,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:32:29,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:32:29,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:32:29,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:32:29,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:32:29,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:32:29,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:32:29,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:32:29,746 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:32:29,746 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:32:29,746 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:32:29,746 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 11:32:29,746 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 11:32:29,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:32:29,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:32:29,746 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:32:29,746 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:32:29,746 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 8d684ebe960d17f15dd8c83d8cf3e676853b2b7a1cdec8ea8ac85aafe28041c6 [2025-01-09 11:32:29,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:32:29,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:32:29,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:32:29,976 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:32:29,976 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:32:29,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-63.i [2025-01-09 11:32:31,178 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec8583462/391bcaf65c114c9797f7ff3b632a684c/FLAGdc1c670aa [2025-01-09 11:32:31,383 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:32:31,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-63.i [2025-01-09 11:32:31,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec8583462/391bcaf65c114c9797f7ff3b632a684c/FLAGdc1c670aa [2025-01-09 11:32:31,755 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec8583462/391bcaf65c114c9797f7ff3b632a684c [2025-01-09 11:32:31,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:32:31,758 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:32:31,759 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:32:31,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:32:31,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:32:31,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:32:31" (1/1) ... [2025-01-09 11:32:31,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c6c5fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:32:31, skipping insertion in model container [2025-01-09 11:32:31,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:32:31" (1/1) ... [2025-01-09 11:32:31,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:32:31,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-63.i[919,932] [2025-01-09 11:32:31,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:32:31,911 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:32:31,918 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-63.i[919,932] [2025-01-09 11:32:31,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:32:31,955 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:32:31,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:32:31 WrapperNode [2025-01-09 11:32:31,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:32:31,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:32:31,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:32:31,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:32:31,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:32:31" (1/1) ... [2025-01-09 11:32:31,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:32:31" (1/1) ... [2025-01-09 11:32:31,988 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2025-01-09 11:32:31,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:32:31,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:32:31,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:32:31,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:32:31,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:32:31" (1/1) ... [2025-01-09 11:32:31,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:32:31" (1/1) ... [2025-01-09 11:32:31,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:32:31" (1/1) ... [2025-01-09 11:32:32,004 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]. [2025-01-09 11:32:32,005 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:32:31" (1/1) ... [2025-01-09 11:32:32,005 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:32:31" (1/1) ... [2025-01-09 11:32:32,011 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:32:31" (1/1) ... [2025-01-09 11:32:32,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:32:31" (1/1) ... [2025-01-09 11:32:32,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:32:31" (1/1) ... [2025-01-09 11:32:32,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:32:31" (1/1) ... [2025-01-09 11:32:32,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:32:31" (1/1) ... [2025-01-09 11:32:32,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:32:32,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:32:32,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:32:32,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:32:32,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:32:31" (1/1) ... [2025-01-09 11:32:32,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:32:32,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:32:32,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 11:32:32,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 11:32:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:32:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 11:32:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:32:32,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:32:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:32:32,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:32:32,124 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:32:32,126 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:32:40,329 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 11:32:40,330 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:32:40,340 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:32:40,341 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:32:40,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:32:40 BoogieIcfgContainer [2025-01-09 11:32:40,341 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:32:40,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:32:40,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:32:40,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:32:40,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:32:31" (1/3) ... [2025-01-09 11:32:40,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8d0e58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:32:40, skipping insertion in model container [2025-01-09 11:32:40,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:32:31" (2/3) ... [2025-01-09 11:32:40,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8d0e58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:32:40, skipping insertion in model container [2025-01-09 11:32:40,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:32:40" (3/3) ... [2025-01-09 11:32:40,348 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-63.i [2025-01-09 11:32:40,358 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:32:40,359 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-63.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:32:40,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:32:40,409 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;@3697a625, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:32:40,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:32:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 59 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 11:32:40,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 11:32:40,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:40,420 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:40,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:40,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:40,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1003306923, now seen corresponding path program 1 times [2025-01-09 11:32:40,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:32:40,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193978841] [2025-01-09 11:32:40,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:40,431 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 [2025-01-09 11:32:40,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:32:40,433 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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) [2025-01-09 11:32:40,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 11:32:40,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 11:32:40,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 11:32:40,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:40,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:32:40,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:32:40,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:32:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 942 proven. 0 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2025-01-09 11:32:40,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:32:40,974 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:32:40,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193978841] [2025-01-09 11:32:40,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193978841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:32:40,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:32:40,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:32:40,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750698809] [2025-01-09 11:32:40,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:32:40,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:32:40,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:32:40,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:32:40,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:32:40,991 INFO L87 Difference]: Start difference. First operand has 93 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 59 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 11:32:41,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:32:41,008 INFO L93 Difference]: Finished difference Result 180 states and 315 transitions. [2025-01-09 11:32:41,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:32:41,009 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 207 [2025-01-09 11:32:41,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:32:41,014 INFO L225 Difference]: With dead ends: 180 [2025-01-09 11:32:41,014 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 11:32:41,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:32:41,017 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:32:41,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:32:41,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 11:32:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-01-09 11:32:41,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 11:32:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2025-01-09 11:32:41,044 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 207 [2025-01-09 11:32:41,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:32:41,044 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 139 transitions. [2025-01-09 11:32:41,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 11:32:41,044 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2025-01-09 11:32:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 11:32:41,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:41,047 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:41,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 11:32:41,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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 [2025-01-09 11:32:41,251 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:41,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:41,252 INFO L85 PathProgramCache]: Analyzing trace with hash 961929599, now seen corresponding path program 1 times [2025-01-09 11:32:41,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:32:41,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868427560] [2025-01-09 11:32:41,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:41,253 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 [2025-01-09 11:32:41,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:32:41,255 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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) [2025-01-09 11:32:41,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 11:32:41,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 11:32:41,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 11:32:41,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:41,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:32:41,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 11:32:41,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:32:43,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:32:43,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:32:43,920 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:32:43,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868427560] [2025-01-09 11:32:43,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868427560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:32:43,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:32:43,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:32:43,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965978371] [2025-01-09 11:32:43,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:32:43,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:32:43,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:32:43,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:32:43,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:32:43,926 INFO L87 Difference]: Start difference. First operand 90 states and 139 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:46,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:32:50,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:32:50,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:32:50,418 INFO L93 Difference]: Finished difference Result 265 states and 412 transitions. [2025-01-09 11:32:50,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:32:50,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2025-01-09 11:32:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:32:50,449 INFO L225 Difference]: With dead ends: 265 [2025-01-09 11:32:50,450 INFO L226 Difference]: Without dead ends: 178 [2025-01-09 11:32:50,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:32:50,456 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 103 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:32:50,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 436 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2025-01-09 11:32:50,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-01-09 11:32:50,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 150. [2025-01-09 11:32:50,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 83 states have (on average 1.2289156626506024) internal successors, (102), 83 states have internal predecessors, (102), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-01-09 11:32:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 230 transitions. [2025-01-09 11:32:50,534 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 230 transitions. Word has length 207 [2025-01-09 11:32:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:32:50,534 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 230 transitions. [2025-01-09 11:32:50,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:50,534 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 230 transitions. [2025-01-09 11:32:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 11:32:50,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:32:50,548 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:32:50,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 11:32:50,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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 [2025-01-09 11:32:50,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:32:50,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:32:50,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1384631425, now seen corresponding path program 1 times [2025-01-09 11:32:50,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:32:50,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586755237] [2025-01-09 11:32:50,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:32:50,753 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 [2025-01-09 11:32:50,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:32:50,761 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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) [2025-01-09 11:32:50,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 11:32:50,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 11:32:51,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 11:32:51,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:32:51,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:32:51,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 11:32:51,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:32:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 11:32:51,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:32:51,321 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:32:51,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586755237] [2025-01-09 11:32:51,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586755237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:32:51,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:32:51,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:32:51,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203732032] [2025-01-09 11:32:51,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:32:51,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:32:51,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:32:51,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:32:51,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:32:51,323 INFO L87 Difference]: Start difference. First operand 150 states and 230 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 11:32:55,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []