./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b7d4f9d78490f5290f13c8883d00adc73ba1976bc9e9ac925a881a19aea54245 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:58:22,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:58:22,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:58:22,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:58:22,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:58:22,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:58:22,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:58:22,356 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:58:22,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:58:22,361 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:58:22,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:58:22,362 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:58:22,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:58:22,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:58:22,363 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:58:22,363 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:58:22,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:58:22,364 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:58:22,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:58:22,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:58:22,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:58:22,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:58:22,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:58:22,368 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:58:22,369 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:58:22,369 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:58:22,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:58:22,369 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:58:22,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:58:22,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:58:22,370 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:58:22,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:58:22,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:58:22,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:58:22,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:58:22,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:58:22,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:58:22,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:58:22,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:58:22,374 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:58:22,374 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:58:22,374 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:58:22,374 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/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 -> b7d4f9d78490f5290f13c8883d00adc73ba1976bc9e9ac925a881a19aea54245 [2024-10-11 13:58:22,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:58:22,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:58:22,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:58:22,677 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:58:22,677 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:58:22,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i [2024-10-11 13:58:24,198 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:58:24,401 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:58:24,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i [2024-10-11 13:58:24,418 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2fb2c51ec/379a9a7a40c548dcb8c7b77a3540873e/FLAG3e8c40963 [2024-10-11 13:58:24,773 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2fb2c51ec/379a9a7a40c548dcb8c7b77a3540873e [2024-10-11 13:58:24,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:58:24,778 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:58:24,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:58:24,780 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:58:24,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:58:24,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:58:24" (1/1) ... [2024-10-11 13:58:24,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53cc7f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:24, skipping insertion in model container [2024-10-11 13:58:24,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:58:24" (1/1) ... [2024-10-11 13:58:24,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:58:25,006 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i[917,930] [2024-10-11 13:58:25,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:58:25,084 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:58:25,097 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i[917,930] [2024-10-11 13:58:25,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:58:25,162 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:58:25,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:25 WrapperNode [2024-10-11 13:58:25,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:58:25,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:58:25,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:58:25,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:58:25,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:25" (1/1) ... [2024-10-11 13:58:25,181 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:25" (1/1) ... [2024-10-11 13:58:25,219 INFO L138 Inliner]: procedures = 29, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 451 [2024-10-11 13:58:25,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:58:25,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:58:25,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:58:25,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:58:25,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:25" (1/1) ... [2024-10-11 13:58:25,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:25" (1/1) ... [2024-10-11 13:58:25,246 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:25" (1/1) ... [2024-10-11 13:58:25,270 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 18 writes are split as follows [0, 18]. [2024-10-11 13:58:25,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:25" (1/1) ... [2024-10-11 13:58:25,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:25" (1/1) ... [2024-10-11 13:58:25,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:25" (1/1) ... [2024-10-11 13:58:25,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:25" (1/1) ... [2024-10-11 13:58:25,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:25" (1/1) ... [2024-10-11 13:58:25,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:25" (1/1) ... [2024-10-11 13:58:25,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:58:25,308 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:58:25,309 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:58:25,309 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:58:25,310 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:25" (1/1) ... [2024-10-11 13:58:25,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:58:25,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:58:25,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:58:25,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:58:25,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:58:25,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:58:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:58:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:58:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:58:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:58:25,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:58:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:58:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:58:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:58:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:58:25,400 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:58:25,401 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:58:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:58:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:58:25,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:58:25,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:58:25,568 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:58:25,569 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:58:26,034 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2024-10-11 13:58:26,034 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:58:26,070 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:58:26,070 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:58:26,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:58:26 BoogieIcfgContainer [2024-10-11 13:58:26,071 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:58:26,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:58:26,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:58:26,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:58:26,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:58:24" (1/3) ... [2024-10-11 13:58:26,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca5027c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:58:26, skipping insertion in model container [2024-10-11 13:58:26,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:25" (2/3) ... [2024-10-11 13:58:26,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca5027c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:58:26, skipping insertion in model container [2024-10-11 13:58:26,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:58:26" (3/3) ... [2024-10-11 13:58:26,081 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-34.i [2024-10-11 13:58:26,096 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:58:26,097 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:58:26,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:58:26,162 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;@5075c2be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:58:26,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:58:26,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:58:26,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 13:58:26,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:26,185 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:26,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:26,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:26,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1982887210, now seen corresponding path program 1 times [2024-10-11 13:58:26,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:26,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825781769] [2024-10-11 13:58:26,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:26,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:26,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:26,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825781769] [2024-10-11 13:58:26,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825781769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:26,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:26,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:58:26,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678270604] [2024-10-11 13:58:26,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:26,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:58:26,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:26,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:58:26,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:58:26,668 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 13:58:26,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:26,719 INFO L93 Difference]: Finished difference Result 223 states and 357 transitions. [2024-10-11 13:58:26,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:58:26,722 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2024-10-11 13:58:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:26,729 INFO L225 Difference]: With dead ends: 223 [2024-10-11 13:58:26,729 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 13:58:26,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:58:26,739 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:26,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:58:26,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 13:58:26,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 13:58:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:58:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2024-10-11 13:58:26,788 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 166 [2024-10-11 13:58:26,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:26,789 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2024-10-11 13:58:26,789 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 13:58:26,789 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2024-10-11 13:58:26,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 13:58:26,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:26,794 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:26,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:58:26,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:26,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:26,795 INFO L85 PathProgramCache]: Analyzing trace with hash 799028980, now seen corresponding path program 1 times [2024-10-11 13:58:26,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:26,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555144777] [2024-10-11 13:58:26,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:26,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:27,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:27,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555144777] [2024-10-11 13:58:27,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555144777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:27,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:27,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:58:27,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038827005] [2024-10-11 13:58:27,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:27,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:58:27,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:27,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:58:27,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:58:27,202 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:27,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:27,253 INFO L93 Difference]: Finished difference Result 222 states and 327 transitions. [2024-10-11 13:58:27,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:58:27,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2024-10-11 13:58:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:27,258 INFO L225 Difference]: With dead ends: 222 [2024-10-11 13:58:27,259 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 13:58:27,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:58:27,262 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:27,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:58:27,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 13:58:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-11 13:58:27,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 87 states have internal predecessors, (118), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:58:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 164 transitions. [2024-10-11 13:58:27,286 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 164 transitions. Word has length 166 [2024-10-11 13:58:27,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:27,288 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 164 transitions. [2024-10-11 13:58:27,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 164 transitions. [2024-10-11 13:58:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 13:58:27,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:27,291 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:27,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:58:27,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:27,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:27,292 INFO L85 PathProgramCache]: Analyzing trace with hash -889914762, now seen corresponding path program 1 times [2024-10-11 13:58:27,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:27,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739098132] [2024-10-11 13:58:27,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:27,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:27,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:27,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:27,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739098132] [2024-10-11 13:58:27,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739098132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:27,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:27,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:58:27,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518813450] [2024-10-11 13:58:27,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:27,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:58:27,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:27,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:58:27,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:58:27,701 INFO L87 Difference]: Start difference. First operand 112 states and 164 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:27,752 INFO L93 Difference]: Finished difference Result 225 states and 330 transitions. [2024-10-11 13:58:27,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:58:27,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2024-10-11 13:58:27,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:27,755 INFO L225 Difference]: With dead ends: 225 [2024-10-11 13:58:27,755 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 13:58:27,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:58:27,760 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:27,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 464 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:58:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 13:58:27,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-11 13:58:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:58:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 166 transitions. [2024-10-11 13:58:27,777 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 166 transitions. Word has length 166 [2024-10-11 13:58:27,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:27,779 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 166 transitions. [2024-10-11 13:58:27,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:27,779 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 166 transitions. [2024-10-11 13:58:27,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 13:58:27,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:27,785 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:27,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:58:27,786 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:27,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:27,786 INFO L85 PathProgramCache]: Analyzing trace with hash -543757980, now seen corresponding path program 1 times [2024-10-11 13:58:27,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:27,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610621729] [2024-10-11 13:58:27,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:27,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:27,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:27,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610621729] [2024-10-11 13:58:27,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610621729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:27,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:27,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:58:27,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269979852] [2024-10-11 13:58:27,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:27,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:58:27,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:27,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:58:27,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:58:27,980 INFO L87 Difference]: Start difference. First operand 114 states and 166 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:28,034 INFO L93 Difference]: Finished difference Result 276 states and 402 transitions. [2024-10-11 13:58:28,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:58:28,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 168 [2024-10-11 13:58:28,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:28,040 INFO L225 Difference]: With dead ends: 276 [2024-10-11 13:58:28,040 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 13:58:28,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:58:28,044 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 56 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:28,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 309 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:58:28,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 13:58:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 133. [2024-10-11 13:58:28,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 108 states have internal predecessors, (148), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:58:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2024-10-11 13:58:28,061 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 168 [2024-10-11 13:58:28,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:28,061 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2024-10-11 13:58:28,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2024-10-11 13:58:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 13:58:28,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:28,064 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:28,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:58:28,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:28,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:28,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1410011260, now seen corresponding path program 1 times [2024-10-11 13:58:28,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:28,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233993424] [2024-10-11 13:58:28,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:28,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:28,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:28,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233993424] [2024-10-11 13:58:28,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233993424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:28,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:28,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:58:28,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214133936] [2024-10-11 13:58:28,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:28,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:58:28,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:28,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:58:28,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:58:28,290 INFO L87 Difference]: Start difference. First operand 133 states and 194 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:28,322 INFO L93 Difference]: Finished difference Result 266 states and 389 transitions. [2024-10-11 13:58:28,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:58:28,322 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2024-10-11 13:58:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:28,324 INFO L225 Difference]: With dead ends: 266 [2024-10-11 13:58:28,324 INFO L226 Difference]: Without dead ends: 134 [2024-10-11 13:58:28,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:58:28,326 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:28,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:58:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-11 13:58:28,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-11 13:58:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 109 states have internal predecessors, (149), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:58:28,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 195 transitions. [2024-10-11 13:58:28,343 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 195 transitions. Word has length 171 [2024-10-11 13:58:28,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:28,345 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 195 transitions. [2024-10-11 13:58:28,345 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 195 transitions. [2024-10-11 13:58:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 13:58:28,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:28,348 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:28,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:58:28,348 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:28,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1151845822, now seen corresponding path program 1 times [2024-10-11 13:58:28,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:28,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016506470] [2024-10-11 13:58:28,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:28,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:29,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:29,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:29,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016506470] [2024-10-11 13:58:29,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016506470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:29,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:29,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:58:29,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042594344] [2024-10-11 13:58:29,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:29,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:58:29,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:29,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:58:29,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:58:29,433 INFO L87 Difference]: Start difference. First operand 134 states and 195 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:29,768 INFO L93 Difference]: Finished difference Result 323 states and 467 transitions. [2024-10-11 13:58:29,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:58:29,769 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2024-10-11 13:58:29,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:29,771 INFO L225 Difference]: With dead ends: 323 [2024-10-11 13:58:29,772 INFO L226 Difference]: Without dead ends: 190 [2024-10-11 13:58:29,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:58:29,773 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 50 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:29,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1029 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:58:29,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-11 13:58:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2024-10-11 13:58:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 138 states have (on average 1.3695652173913044) internal successors, (189), 138 states have internal predecessors, (189), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:58:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 235 transitions. [2024-10-11 13:58:29,793 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 235 transitions. Word has length 171 [2024-10-11 13:58:29,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:29,794 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 235 transitions. [2024-10-11 13:58:29,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 235 transitions. [2024-10-11 13:58:29,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 13:58:29,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:29,799 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:29,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:58:29,799 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:29,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:29,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1544872832, now seen corresponding path program 1 times [2024-10-11 13:58:29,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:29,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865597401] [2024-10-11 13:58:29,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:29,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:30,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:30,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865597401] [2024-10-11 13:58:30,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865597401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:30,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:30,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:58:30,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558848942] [2024-10-11 13:58:30,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:30,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:58:30,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:30,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:58:30,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:30,719 INFO L87 Difference]: Start difference. First operand 163 states and 235 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 13:58:31,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:31,225 INFO L93 Difference]: Finished difference Result 352 states and 506 transitions. [2024-10-11 13:58:31,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:58:31,227 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2024-10-11 13:58:31,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:31,229 INFO L225 Difference]: With dead ends: 352 [2024-10-11 13:58:31,229 INFO L226 Difference]: Without dead ends: 190 [2024-10-11 13:58:31,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:58:31,230 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 344 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:31,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 400 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:58:31,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-11 13:58:31,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2024-10-11 13:58:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 138 states have (on average 1.3623188405797102) internal successors, (188), 138 states have internal predecessors, (188), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:58:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 234 transitions. [2024-10-11 13:58:31,248 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 234 transitions. Word has length 171 [2024-10-11 13:58:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:31,248 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 234 transitions. [2024-10-11 13:58:31,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 13:58:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 234 transitions. [2024-10-11 13:58:31,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 13:58:31,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:31,255 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:31,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:58:31,255 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:31,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash -932991104, now seen corresponding path program 1 times [2024-10-11 13:58:31,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:31,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037468579] [2024-10-11 13:58:31,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:31,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:31,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:31,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:32,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:32,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:32,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:32,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:32,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037468579] [2024-10-11 13:58:32,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037468579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:32,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:32,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:58:32,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008517932] [2024-10-11 13:58:32,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:32,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:58:32,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:32,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:58:32,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:32,012 INFO L87 Difference]: Start difference. First operand 163 states and 234 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 13:58:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:32,389 INFO L93 Difference]: Finished difference Result 375 states and 538 transitions. [2024-10-11 13:58:32,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:58:32,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2024-10-11 13:58:32,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:32,391 INFO L225 Difference]: With dead ends: 375 [2024-10-11 13:58:32,391 INFO L226 Difference]: Without dead ends: 213 [2024-10-11 13:58:32,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:58:32,393 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 237 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:32,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 406 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:58:32,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-11 13:58:32,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 186. [2024-10-11 13:58:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:58:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 267 transitions. [2024-10-11 13:58:32,404 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 267 transitions. Word has length 171 [2024-10-11 13:58:32,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:32,404 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 267 transitions. [2024-10-11 13:58:32,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 13:58:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 267 transitions. [2024-10-11 13:58:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 13:58:32,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:32,406 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:32,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:58:32,406 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:32,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:32,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1326018114, now seen corresponding path program 1 times [2024-10-11 13:58:32,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:32,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193263367] [2024-10-11 13:58:32,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:32,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:33,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:33,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:33,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193263367] [2024-10-11 13:58:33,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193263367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:33,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:33,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:58:33,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653279438] [2024-10-11 13:58:33,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:33,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:58:33,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:33,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:58:33,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:58:33,959 INFO L87 Difference]: Start difference. First operand 186 states and 267 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:34,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:34,756 INFO L93 Difference]: Finished difference Result 401 states and 574 transitions. [2024-10-11 13:58:34,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:58:34,757 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2024-10-11 13:58:34,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:34,759 INFO L225 Difference]: With dead ends: 401 [2024-10-11 13:58:34,759 INFO L226 Difference]: Without dead ends: 216 [2024-10-11 13:58:34,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:58:34,760 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 155 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:34,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1134 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:58:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-11 13:58:34,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 186. [2024-10-11 13:58:34,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.3726708074534162) internal successors, (221), 161 states have internal predecessors, (221), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:58:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 267 transitions. [2024-10-11 13:58:34,773 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 267 transitions. Word has length 171 [2024-10-11 13:58:34,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:34,773 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 267 transitions. [2024-10-11 13:58:34,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:34,774 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 267 transitions. [2024-10-11 13:58:34,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 13:58:34,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:34,775 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:34,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:58:34,776 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:34,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1450268400, now seen corresponding path program 1 times [2024-10-11 13:58:34,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:34,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208495997] [2024-10-11 13:58:34,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:34,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:34,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:34,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:34,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:34,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:34,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208495997] [2024-10-11 13:58:34,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208495997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:34,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:34,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:58:34,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619059384] [2024-10-11 13:58:34,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:34,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:58:34,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:34,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:58:34,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:58:34,896 INFO L87 Difference]: Start difference. First operand 186 states and 267 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:34,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:34,931 INFO L93 Difference]: Finished difference Result 409 states and 586 transitions. [2024-10-11 13:58:34,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:58:34,932 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2024-10-11 13:58:34,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:34,934 INFO L225 Difference]: With dead ends: 409 [2024-10-11 13:58:34,934 INFO L226 Difference]: Without dead ends: 224 [2024-10-11 13:58:34,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:58:34,935 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 60 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:34,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 361 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:58:34,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-11 13:58:34,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 186. [2024-10-11 13:58:34,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.329192546583851) internal successors, (214), 161 states have internal predecessors, (214), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:58:34,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 260 transitions. [2024-10-11 13:58:34,951 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 260 transitions. Word has length 171 [2024-10-11 13:58:34,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:34,951 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 260 transitions. [2024-10-11 13:58:34,952 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:34,952 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 260 transitions. [2024-10-11 13:58:34,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 13:58:34,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:34,954 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:34,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:58:34,955 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:34,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:34,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1097966277, now seen corresponding path program 1 times [2024-10-11 13:58:34,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:34,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017510839] [2024-10-11 13:58:34,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:34,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:35,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:35,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:35,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017510839] [2024-10-11 13:58:35,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017510839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:35,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:35,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:58:35,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109485028] [2024-10-11 13:58:35,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:35,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:58:35,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:35,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:58:35,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:58:35,448 INFO L87 Difference]: Start difference. First operand 186 states and 260 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:35,730 INFO L93 Difference]: Finished difference Result 409 states and 569 transitions. [2024-10-11 13:58:35,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:58:35,731 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), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 172 [2024-10-11 13:58:35,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:35,733 INFO L225 Difference]: With dead ends: 409 [2024-10-11 13:58:35,733 INFO L226 Difference]: Without dead ends: 224 [2024-10-11 13:58:35,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:58:35,734 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 183 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:35,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 485 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:58:35,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-11 13:58:35,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 199. [2024-10-11 13:58:35,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 174 states have (on average 1.3218390804597702) internal successors, (230), 174 states have internal predecessors, (230), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:58:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 276 transitions. [2024-10-11 13:58:35,751 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 276 transitions. Word has length 172 [2024-10-11 13:58:35,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:35,751 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 276 transitions. [2024-10-11 13:58:35,752 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), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 276 transitions. [2024-10-11 13:58:35,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 13:58:35,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:35,754 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:35,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 13:58:35,755 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:35,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:35,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1774683992, now seen corresponding path program 1 times [2024-10-11 13:58:35,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:35,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102822438] [2024-10-11 13:58:35,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:35,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:36,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:36,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102822438] [2024-10-11 13:58:36,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102822438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:36,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:36,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:58:36,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316754920] [2024-10-11 13:58:36,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:36,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:58:36,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:36,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:58:36,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:58:36,327 INFO L87 Difference]: Start difference. First operand 199 states and 276 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:36,774 INFO L93 Difference]: Finished difference Result 453 states and 628 transitions. [2024-10-11 13:58:36,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:58:36,775 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2024-10-11 13:58:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:36,778 INFO L225 Difference]: With dead ends: 453 [2024-10-11 13:58:36,778 INFO L226 Difference]: Without dead ends: 255 [2024-10-11 13:58:36,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:58:36,779 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 161 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:36,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 520 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:58:36,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-11 13:58:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 228. [2024-10-11 13:58:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.3251231527093597) internal successors, (269), 203 states have internal predecessors, (269), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:58:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 315 transitions. [2024-10-11 13:58:36,807 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 315 transitions. Word has length 173 [2024-10-11 13:58:36,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:36,808 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 315 transitions. [2024-10-11 13:58:36,808 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 315 transitions. [2024-10-11 13:58:36,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 13:58:36,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:36,810 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:36,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:58:36,811 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:36,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:36,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1836723606, now seen corresponding path program 1 times [2024-10-11 13:58:36,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:36,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029124757] [2024-10-11 13:58:36,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:36,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:37,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:37,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:37,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029124757] [2024-10-11 13:58:37,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029124757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:37,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:37,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:58:37,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391160701] [2024-10-11 13:58:37,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:37,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:58:37,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:37,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:58:37,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:37,454 INFO L87 Difference]: Start difference. First operand 228 states and 315 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:37,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:37,780 INFO L93 Difference]: Finished difference Result 493 states and 679 transitions. [2024-10-11 13:58:37,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:58:37,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2024-10-11 13:58:37,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:37,784 INFO L225 Difference]: With dead ends: 493 [2024-10-11 13:58:37,784 INFO L226 Difference]: Without dead ends: 266 [2024-10-11 13:58:37,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:58:37,785 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 254 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:37,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 501 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:58:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-11 13:58:37,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 212. [2024-10-11 13:58:37,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 187 states have (on average 1.3262032085561497) internal successors, (248), 187 states have internal predecessors, (248), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:58:37,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 294 transitions. [2024-10-11 13:58:37,804 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 294 transitions. Word has length 173 [2024-10-11 13:58:37,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:37,808 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 294 transitions. [2024-10-11 13:58:37,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:37,808 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 294 transitions. [2024-10-11 13:58:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 13:58:37,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:37,810 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:37,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 13:58:37,810 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:37,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:37,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1098401000, now seen corresponding path program 1 times [2024-10-11 13:58:37,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:37,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695409556] [2024-10-11 13:58:37,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:37,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:38,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:38,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:38,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695409556] [2024-10-11 13:58:38,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695409556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:38,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:38,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:58:38,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265175321] [2024-10-11 13:58:38,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:38,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:58:38,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:38,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:58:38,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:58:38,367 INFO L87 Difference]: Start difference. First operand 212 states and 294 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:38,694 INFO L93 Difference]: Finished difference Result 462 states and 639 transitions. [2024-10-11 13:58:38,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:58:38,695 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2024-10-11 13:58:38,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:38,697 INFO L225 Difference]: With dead ends: 462 [2024-10-11 13:58:38,697 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 13:58:38,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:58:38,698 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 329 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:38,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 367 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:58:38,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 13:58:38,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 225. [2024-10-11 13:58:38,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 200 states have (on average 1.305) internal successors, (261), 200 states have internal predecessors, (261), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:58:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 307 transitions. [2024-10-11 13:58:38,714 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 307 transitions. Word has length 173 [2024-10-11 13:58:38,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:38,714 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 307 transitions. [2024-10-11 13:58:38,714 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 307 transitions. [2024-10-11 13:58:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 13:58:38,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:38,716 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:38,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 13:58:38,717 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:38,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:38,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2109518250, now seen corresponding path program 1 times [2024-10-11 13:58:38,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:38,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567203107] [2024-10-11 13:58:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:38,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:39,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:39,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567203107] [2024-10-11 13:58:39,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567203107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:39,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:39,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:58:39,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384977741] [2024-10-11 13:58:39,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:39,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:58:39,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:39,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:58:39,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:39,255 INFO L87 Difference]: Start difference. First operand 225 states and 307 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:39,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:39,546 INFO L93 Difference]: Finished difference Result 467 states and 637 transitions. [2024-10-11 13:58:39,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:58:39,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2024-10-11 13:58:39,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:39,549 INFO L225 Difference]: With dead ends: 467 [2024-10-11 13:58:39,549 INFO L226 Difference]: Without dead ends: 243 [2024-10-11 13:58:39,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:58:39,550 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 180 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:39,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 401 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:58:39,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-11 13:58:39,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 225. [2024-10-11 13:58:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 200 states have (on average 1.275) internal successors, (255), 200 states have internal predecessors, (255), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:58:39,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 301 transitions. [2024-10-11 13:58:39,568 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 301 transitions. Word has length 173 [2024-10-11 13:58:39,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:39,569 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 301 transitions. [2024-10-11 13:58:39,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 301 transitions. [2024-10-11 13:58:39,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 13:58:39,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:39,572 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:39,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 13:58:39,573 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:39,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:39,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1817118025, now seen corresponding path program 1 times [2024-10-11 13:58:39,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:39,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14709863] [2024-10-11 13:58:39,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:39,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:39,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:39,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14709863] [2024-10-11 13:58:39,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14709863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:39,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:39,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:58:39,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932057101] [2024-10-11 13:58:39,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:39,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:58:39,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:39,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:58:39,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:58:39,794 INFO L87 Difference]: Start difference. First operand 225 states and 301 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:39,835 INFO L93 Difference]: Finished difference Result 452 states and 605 transitions. [2024-10-11 13:58:39,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:58:39,835 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2024-10-11 13:58:39,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:39,838 INFO L225 Difference]: With dead ends: 452 [2024-10-11 13:58:39,838 INFO L226 Difference]: Without dead ends: 228 [2024-10-11 13:58:39,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:58:39,839 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:39,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 606 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:58:39,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-11 13:58:39,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2024-10-11 13:58:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 203 states have (on average 1.270935960591133) internal successors, (258), 203 states have internal predecessors, (258), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:58:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 304 transitions. [2024-10-11 13:58:39,854 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 304 transitions. Word has length 173 [2024-10-11 13:58:39,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:39,855 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 304 transitions. [2024-10-11 13:58:39,855 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 304 transitions. [2024-10-11 13:58:39,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 13:58:39,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:39,857 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:39,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 13:58:39,857 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:39,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:39,857 INFO L85 PathProgramCache]: Analyzing trace with hash 799532139, now seen corresponding path program 1 times [2024-10-11 13:58:39,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:39,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998069691] [2024-10-11 13:58:39,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:39,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:40,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:40,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:40,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:40,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998069691] [2024-10-11 13:58:40,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998069691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:40,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:40,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:58:40,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377738315] [2024-10-11 13:58:40,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:40,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:58:40,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:40,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:58:40,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:58:40,131 INFO L87 Difference]: Start difference. First operand 228 states and 304 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:40,397 INFO L93 Difference]: Finished difference Result 621 states and 830 transitions. [2024-10-11 13:58:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:58:40,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2024-10-11 13:58:40,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:40,400 INFO L225 Difference]: With dead ends: 621 [2024-10-11 13:58:40,400 INFO L226 Difference]: Without dead ends: 394 [2024-10-11 13:58:40,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:58:40,401 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 113 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:40,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 385 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:58:40,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-11 13:58:40,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 285. [2024-10-11 13:58:40,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 236 states have (on average 1.2457627118644068) internal successors, (294), 236 states have internal predecessors, (294), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:40,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 386 transitions. [2024-10-11 13:58:40,431 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 386 transitions. Word has length 173 [2024-10-11 13:58:40,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:40,432 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 386 transitions. [2024-10-11 13:58:40,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 386 transitions. [2024-10-11 13:58:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 13:58:40,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:40,435 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:40,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 13:58:40,435 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:40,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:40,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1906828626, now seen corresponding path program 1 times [2024-10-11 13:58:40,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:40,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978702604] [2024-10-11 13:58:40,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:40,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:41,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:41,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:41,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978702604] [2024-10-11 13:58:41,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978702604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:41,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:41,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:58:41,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446603875] [2024-10-11 13:58:41,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:41,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:58:41,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:41,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:58:41,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:58:41,046 INFO L87 Difference]: Start difference. First operand 285 states and 386 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:41,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:41,322 INFO L93 Difference]: Finished difference Result 591 states and 791 transitions. [2024-10-11 13:58:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:58:41,322 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-11 13:58:41,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:41,324 INFO L225 Difference]: With dead ends: 591 [2024-10-11 13:58:41,325 INFO L226 Difference]: Without dead ends: 364 [2024-10-11 13:58:41,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:58:41,326 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 49 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:41,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1422 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:58:41,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-11 13:58:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 336. [2024-10-11 13:58:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 287 states have (on average 1.2508710801393728) internal successors, (359), 287 states have internal predecessors, (359), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 451 transitions. [2024-10-11 13:58:41,347 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 451 transitions. Word has length 175 [2024-10-11 13:58:41,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:41,347 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 451 transitions. [2024-10-11 13:58:41,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 451 transitions. [2024-10-11 13:58:41,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 13:58:41,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:41,349 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:41,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 13:58:41,350 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:41,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:41,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1995111660, now seen corresponding path program 1 times [2024-10-11 13:58:41,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:41,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911514922] [2024-10-11 13:58:41,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:41,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:41,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:41,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:41,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911514922] [2024-10-11 13:58:41,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911514922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:41,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:41,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:58:41,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890126392] [2024-10-11 13:58:41,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:41,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:58:41,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:41,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:58:41,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:58:41,471 INFO L87 Difference]: Start difference. First operand 336 states and 451 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:41,510 INFO L93 Difference]: Finished difference Result 619 states and 826 transitions. [2024-10-11 13:58:41,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:58:41,511 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-11 13:58:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:41,513 INFO L225 Difference]: With dead ends: 619 [2024-10-11 13:58:41,513 INFO L226 Difference]: Without dead ends: 341 [2024-10-11 13:58:41,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:58:41,514 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:41,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 456 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:58:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-11 13:58:41,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 340. [2024-10-11 13:58:41,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 291 states have (on average 1.2474226804123711) internal successors, (363), 291 states have internal predecessors, (363), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 455 transitions. [2024-10-11 13:58:41,534 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 455 transitions. Word has length 175 [2024-10-11 13:58:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:41,535 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 455 transitions. [2024-10-11 13:58:41,535 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:41,535 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 455 transitions. [2024-10-11 13:58:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 13:58:41,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:41,537 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:41,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 13:58:41,537 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:41,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:41,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2041690198, now seen corresponding path program 1 times [2024-10-11 13:58:41,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:41,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139818711] [2024-10-11 13:58:41,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:41,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:41,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:41,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:41,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139818711] [2024-10-11 13:58:41,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139818711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:41,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:41,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:58:41,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673153113] [2024-10-11 13:58:41,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:41,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:58:41,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:41,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:58:41,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:58:41,881 INFO L87 Difference]: Start difference. First operand 340 states and 455 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:42,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:42,072 INFO L93 Difference]: Finished difference Result 662 states and 877 transitions. [2024-10-11 13:58:42,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:58:42,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-11 13:58:42,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:42,075 INFO L225 Difference]: With dead ends: 662 [2024-10-11 13:58:42,075 INFO L226 Difference]: Without dead ends: 380 [2024-10-11 13:58:42,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:42,076 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 31 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:42,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 675 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:58:42,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-10-11 13:58:42,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 344. [2024-10-11 13:58:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 295 states have (on average 1.2508474576271187) internal successors, (369), 295 states have internal predecessors, (369), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 461 transitions. [2024-10-11 13:58:42,100 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 461 transitions. Word has length 175 [2024-10-11 13:58:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:42,100 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 461 transitions. [2024-10-11 13:58:42,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 461 transitions. [2024-10-11 13:58:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 13:58:42,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:42,102 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:42,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 13:58:42,103 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:42,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:42,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2040842132, now seen corresponding path program 1 times [2024-10-11 13:58:42,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:42,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292365651] [2024-10-11 13:58:42,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:42,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:42,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:42,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292365651] [2024-10-11 13:58:42,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292365651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:42,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:42,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:58:42,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127215488] [2024-10-11 13:58:42,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:42,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:58:42,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:42,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:58:42,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:58:42,227 INFO L87 Difference]: Start difference. First operand 344 states and 461 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:42,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:42,268 INFO L93 Difference]: Finished difference Result 638 states and 851 transitions. [2024-10-11 13:58:42,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:58:42,269 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-11 13:58:42,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:42,272 INFO L225 Difference]: With dead ends: 638 [2024-10-11 13:58:42,272 INFO L226 Difference]: Without dead ends: 352 [2024-10-11 13:58:42,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:58:42,274 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:42,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 456 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:58:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-11 13:58:42,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2024-10-11 13:58:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 303 states have (on average 1.2442244224422443) internal successors, (377), 303 states have internal predecessors, (377), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 469 transitions. [2024-10-11 13:58:42,298 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 469 transitions. Word has length 175 [2024-10-11 13:58:42,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:42,298 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 469 transitions. [2024-10-11 13:58:42,299 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 469 transitions. [2024-10-11 13:58:42,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 13:58:42,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:42,300 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:42,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 13:58:42,301 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:42,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:42,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1978802518, now seen corresponding path program 1 times [2024-10-11 13:58:42,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:42,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983964455] [2024-10-11 13:58:42,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:42,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:42,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:42,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:42,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983964455] [2024-10-11 13:58:42,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983964455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:42,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:42,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:58:42,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422482139] [2024-10-11 13:58:42,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:42,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:58:42,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:42,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:58:42,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:58:42,589 INFO L87 Difference]: Start difference. First operand 352 states and 469 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:42,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:42,748 INFO L93 Difference]: Finished difference Result 652 states and 863 transitions. [2024-10-11 13:58:42,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:58:42,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-11 13:58:42,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:42,751 INFO L225 Difference]: With dead ends: 652 [2024-10-11 13:58:42,751 INFO L226 Difference]: Without dead ends: 358 [2024-10-11 13:58:42,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:42,752 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 106 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:42,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 613 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:58:42,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-11 13:58:42,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 325. [2024-10-11 13:58:42,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 276 states have (on average 1.2391304347826086) internal successors, (342), 276 states have internal predecessors, (342), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:42,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 434 transitions. [2024-10-11 13:58:42,772 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 434 transitions. Word has length 175 [2024-10-11 13:58:42,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:42,772 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 434 transitions. [2024-10-11 13:58:42,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 434 transitions. [2024-10-11 13:58:42,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 13:58:42,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:42,774 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:42,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 13:58:42,775 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:42,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:42,775 INFO L85 PathProgramCache]: Analyzing trace with hash 732686758, now seen corresponding path program 1 times [2024-10-11 13:58:42,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:42,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768590015] [2024-10-11 13:58:42,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:42,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:43,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:43,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:43,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768590015] [2024-10-11 13:58:43,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768590015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:43,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:43,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:58:43,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900133265] [2024-10-11 13:58:43,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:43,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:58:43,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:43,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:58:43,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:58:43,272 INFO L87 Difference]: Start difference. First operand 325 states and 434 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:43,673 INFO L93 Difference]: Finished difference Result 677 states and 892 transitions. [2024-10-11 13:58:43,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:58:43,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-11 13:58:43,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:43,676 INFO L225 Difference]: With dead ends: 677 [2024-10-11 13:58:43,677 INFO L226 Difference]: Without dead ends: 410 [2024-10-11 13:58:43,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:58:43,678 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 164 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:43,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 509 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:58:43,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-10-11 13:58:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 377. [2024-10-11 13:58:43,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 328 states have (on average 1.2378048780487805) internal successors, (406), 328 states have internal predecessors, (406), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:43,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 498 transitions. [2024-10-11 13:58:43,715 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 498 transitions. Word has length 175 [2024-10-11 13:58:43,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:43,716 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 498 transitions. [2024-10-11 13:58:43,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 498 transitions. [2024-10-11 13:58:43,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 13:58:43,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:43,718 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:43,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 13:58:43,719 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:43,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:43,719 INFO L85 PathProgramCache]: Analyzing trace with hash 794726372, now seen corresponding path program 1 times [2024-10-11 13:58:43,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:43,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444036490] [2024-10-11 13:58:43,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:43,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:44,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:44,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:44,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444036490] [2024-10-11 13:58:44,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444036490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:44,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:44,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:58:44,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116833316] [2024-10-11 13:58:44,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:44,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:58:44,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:44,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:58:44,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:58:44,051 INFO L87 Difference]: Start difference. First operand 377 states and 498 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:44,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:44,186 INFO L93 Difference]: Finished difference Result 669 states and 878 transitions. [2024-10-11 13:58:44,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:58:44,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-11 13:58:44,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:44,188 INFO L225 Difference]: With dead ends: 669 [2024-10-11 13:58:44,189 INFO L226 Difference]: Without dead ends: 350 [2024-10-11 13:58:44,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:44,190 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 17 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:44,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 547 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:58:44,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-11 13:58:44,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2024-10-11 13:58:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 301 states have (on average 1.2259136212624584) internal successors, (369), 301 states have internal predecessors, (369), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 461 transitions. [2024-10-11 13:58:44,212 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 461 transitions. Word has length 175 [2024-10-11 13:58:44,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:44,213 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 461 transitions. [2024-10-11 13:58:44,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:44,213 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 461 transitions. [2024-10-11 13:58:44,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 13:58:44,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:44,214 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:44,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 13:58:44,214 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:44,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:44,215 INFO L85 PathProgramCache]: Analyzing trace with hash 795574438, now seen corresponding path program 1 times [2024-10-11 13:58:44,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:44,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834339228] [2024-10-11 13:58:44,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:44,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:44,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:44,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834339228] [2024-10-11 13:58:44,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834339228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:44,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:44,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:58:44,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836776998] [2024-10-11 13:58:44,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:44,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:58:44,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:44,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:58:44,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:44,714 INFO L87 Difference]: Start difference. First operand 350 states and 461 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 13:58:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:45,172 INFO L93 Difference]: Finished difference Result 677 states and 884 transitions. [2024-10-11 13:58:45,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:58:45,173 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), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2024-10-11 13:58:45,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:45,175 INFO L225 Difference]: With dead ends: 677 [2024-10-11 13:58:45,175 INFO L226 Difference]: Without dead ends: 385 [2024-10-11 13:58:45,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:58:45,177 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 252 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:45,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 451 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:58:45,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-11 13:58:45,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 352. [2024-10-11 13:58:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 303 states have (on average 1.221122112211221) internal successors, (370), 303 states have internal predecessors, (370), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 462 transitions. [2024-10-11 13:58:45,207 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 462 transitions. Word has length 175 [2024-10-11 13:58:45,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:45,207 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 462 transitions. [2024-10-11 13:58:45,208 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), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 13:58:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 462 transitions. [2024-10-11 13:58:45,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 13:58:45,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:45,209 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:45,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 13:58:45,209 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:45,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:45,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1053739876, now seen corresponding path program 1 times [2024-10-11 13:58:45,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:45,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370618377] [2024-10-11 13:58:45,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:45,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:45,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:45,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:45,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370618377] [2024-10-11 13:58:45,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370618377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:45,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:45,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:58:45,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028590600] [2024-10-11 13:58:45,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:45,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:58:45,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:45,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:58:45,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:58:45,492 INFO L87 Difference]: Start difference. First operand 352 states and 462 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:45,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:45,645 INFO L93 Difference]: Finished difference Result 679 states and 880 transitions. [2024-10-11 13:58:45,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:58:45,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-11 13:58:45,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:45,648 INFO L225 Difference]: With dead ends: 679 [2024-10-11 13:58:45,649 INFO L226 Difference]: Without dead ends: 385 [2024-10-11 13:58:45,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:45,650 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 69 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:45,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 531 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:58:45,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-11 13:58:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 352. [2024-10-11 13:58:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 303 states have (on average 1.2178217821782178) internal successors, (369), 303 states have internal predecessors, (369), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:45,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 461 transitions. [2024-10-11 13:58:45,675 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 461 transitions. Word has length 175 [2024-10-11 13:58:45,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:45,676 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 461 transitions. [2024-10-11 13:58:45,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:45,676 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 461 transitions. [2024-10-11 13:58:45,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 13:58:45,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:45,677 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:45,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 13:58:45,677 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:45,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:45,677 INFO L85 PathProgramCache]: Analyzing trace with hash 660712866, now seen corresponding path program 1 times [2024-10-11 13:58:45,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:45,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138997349] [2024-10-11 13:58:45,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:45,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:48,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:48,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:48,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138997349] [2024-10-11 13:58:48,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138997349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:48,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:48,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 13:58:48,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079591578] [2024-10-11 13:58:48,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:48,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 13:58:48,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:48,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 13:58:48,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:58:48,185 INFO L87 Difference]: Start difference. First operand 352 states and 461 transitions. Second operand has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) [2024-10-11 13:58:49,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:49,207 INFO L93 Difference]: Finished difference Result 675 states and 877 transitions. [2024-10-11 13:58:49,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:58:49,207 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) Word has length 175 [2024-10-11 13:58:49,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:49,210 INFO L225 Difference]: With dead ends: 675 [2024-10-11 13:58:49,210 INFO L226 Difference]: Without dead ends: 381 [2024-10-11 13:58:49,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:58:49,211 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 241 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:49,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1061 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:58:49,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-11 13:58:49,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 354. [2024-10-11 13:58:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 305 states have (on average 1.2163934426229508) internal successors, (371), 305 states have internal predecessors, (371), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 463 transitions. [2024-10-11 13:58:49,240 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 463 transitions. Word has length 175 [2024-10-11 13:58:49,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:49,240 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 463 transitions. [2024-10-11 13:58:49,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.846153846153846) internal successors, (63), 15 states have internal predecessors, (63), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) [2024-10-11 13:58:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 463 transitions. [2024-10-11 13:58:49,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 13:58:49,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:49,242 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:49,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 13:58:49,242 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:49,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:49,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1472294428, now seen corresponding path program 1 times [2024-10-11 13:58:49,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:49,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711786448] [2024-10-11 13:58:49,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:49,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:49,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:49,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:49,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711786448] [2024-10-11 13:58:49,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711786448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:49,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:49,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:58:49,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836742681] [2024-10-11 13:58:49,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:49,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:58:49,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:49,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:58:49,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:49,899 INFO L87 Difference]: Start difference. First operand 354 states and 463 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:50,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:50,340 INFO L93 Difference]: Finished difference Result 571 states and 731 transitions. [2024-10-11 13:58:50,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:58:50,341 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-11 13:58:50,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:50,343 INFO L225 Difference]: With dead ends: 571 [2024-10-11 13:58:50,343 INFO L226 Difference]: Without dead ends: 569 [2024-10-11 13:58:50,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:58:50,344 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 173 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:50,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 622 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:58:50,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-10-11 13:58:50,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 558. [2024-10-11 13:58:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 509 states have (on average 1.223968565815324) internal successors, (623), 509 states have internal predecessors, (623), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 715 transitions. [2024-10-11 13:58:50,378 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 715 transitions. Word has length 175 [2024-10-11 13:58:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:50,379 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 715 transitions. [2024-10-11 13:58:50,379 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 715 transitions. [2024-10-11 13:58:50,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 13:58:50,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:50,381 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:50,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 13:58:50,381 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:50,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:50,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1494926682, now seen corresponding path program 1 times [2024-10-11 13:58:50,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:50,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104463711] [2024-10-11 13:58:50,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:50,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:51,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:51,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104463711] [2024-10-11 13:58:51,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104463711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:51,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:51,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:58:51,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283979661] [2024-10-11 13:58:51,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:51,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:58:51,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:51,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:58:51,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:58:51,308 INFO L87 Difference]: Start difference. First operand 558 states and 715 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 13:58:51,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:51,496 INFO L93 Difference]: Finished difference Result 1078 states and 1372 transitions. [2024-10-11 13:58:51,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:58:51,497 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), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2024-10-11 13:58:51,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:51,500 INFO L225 Difference]: With dead ends: 1078 [2024-10-11 13:58:51,500 INFO L226 Difference]: Without dead ends: 578 [2024-10-11 13:58:51,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:58:51,502 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 47 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:51,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 467 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:58:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-10-11 13:58:51,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 563. [2024-10-11 13:58:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 514 states have (on average 1.2256809338521402) internal successors, (630), 514 states have internal predecessors, (630), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 722 transitions. [2024-10-11 13:58:51,535 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 722 transitions. Word has length 175 [2024-10-11 13:58:51,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:51,535 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 722 transitions. [2024-10-11 13:58:51,536 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), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 13:58:51,536 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 722 transitions. [2024-10-11 13:58:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 13:58:51,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:51,537 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:51,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 13:58:51,537 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:51,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:51,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1311023621, now seen corresponding path program 1 times [2024-10-11 13:58:51,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:51,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628524215] [2024-10-11 13:58:51,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:51,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:52,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:52,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628524215] [2024-10-11 13:58:52,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628524215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:52,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:52,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:58:52,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904068474] [2024-10-11 13:58:52,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:52,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:58:52,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:52,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:58:52,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:58:52,246 INFO L87 Difference]: Start difference. First operand 563 states and 722 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:52,602 INFO L93 Difference]: Finished difference Result 1138 states and 1449 transitions. [2024-10-11 13:58:52,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:58:52,603 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2024-10-11 13:58:52,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:52,606 INFO L225 Difference]: With dead ends: 1138 [2024-10-11 13:58:52,606 INFO L226 Difference]: Without dead ends: 638 [2024-10-11 13:58:52,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:58:52,608 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 213 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:52,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1157 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:58:52,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2024-10-11 13:58:52,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 582. [2024-10-11 13:58:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 533 states have (on average 1.2307692307692308) internal successors, (656), 533 states have internal predecessors, (656), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 748 transitions. [2024-10-11 13:58:52,644 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 748 transitions. Word has length 176 [2024-10-11 13:58:52,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:52,645 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 748 transitions. [2024-10-11 13:58:52,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 748 transitions. [2024-10-11 13:58:52,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 13:58:52,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:52,646 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:52,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 13:58:52,647 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:52,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:52,647 INFO L85 PathProgramCache]: Analyzing trace with hash 165044799, now seen corresponding path program 1 times [2024-10-11 13:58:52,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:52,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844594587] [2024-10-11 13:58:52,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:52,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:53,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:53,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844594587] [2024-10-11 13:58:53,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844594587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:53,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:53,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:58:53,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160284928] [2024-10-11 13:58:53,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:53,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:58:53,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:53,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:58:53,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:53,314 INFO L87 Difference]: Start difference. First operand 582 states and 748 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 13:58:53,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:53,671 INFO L93 Difference]: Finished difference Result 1172 states and 1496 transitions. [2024-10-11 13:58:53,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:58:53,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 176 [2024-10-11 13:58:53,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:53,675 INFO L225 Difference]: With dead ends: 1172 [2024-10-11 13:58:53,676 INFO L226 Difference]: Without dead ends: 653 [2024-10-11 13:58:53,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:58:53,678 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 253 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:53,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 395 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:58:53,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-10-11 13:58:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 597. [2024-10-11 13:58:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 548 states have (on average 1.2335766423357664) internal successors, (676), 548 states have internal predecessors, (676), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 768 transitions. [2024-10-11 13:58:53,723 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 768 transitions. Word has length 176 [2024-10-11 13:58:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:53,724 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 768 transitions. [2024-10-11 13:58:53,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 13:58:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 768 transitions. [2024-10-11 13:58:53,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 13:58:53,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:53,726 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:53,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 13:58:53,726 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:53,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:53,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2088272833, now seen corresponding path program 1 times [2024-10-11 13:58:53,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:53,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418712439] [2024-10-11 13:58:53,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:53,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:54,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:54,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:54,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418712439] [2024-10-11 13:58:54,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418712439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:54,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:54,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:58:54,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292367921] [2024-10-11 13:58:54,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:54,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:58:54,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:54,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:58:54,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:58:54,424 INFO L87 Difference]: Start difference. First operand 597 states and 768 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:54,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:54,887 INFO L93 Difference]: Finished difference Result 1199 states and 1530 transitions. [2024-10-11 13:58:54,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:58:54,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2024-10-11 13:58:54,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:54,891 INFO L225 Difference]: With dead ends: 1199 [2024-10-11 13:58:54,891 INFO L226 Difference]: Without dead ends: 665 [2024-10-11 13:58:54,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:58:54,893 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 151 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:54,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 503 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:58:54,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-10-11 13:58:54,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 597. [2024-10-11 13:58:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 548 states have (on average 1.2335766423357664) internal successors, (676), 548 states have internal predecessors, (676), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 768 transitions. [2024-10-11 13:58:54,953 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 768 transitions. Word has length 176 [2024-10-11 13:58:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:54,954 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 768 transitions. [2024-10-11 13:58:54,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 768 transitions. [2024-10-11 13:58:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 13:58:54,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:54,956 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:54,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 13:58:54,957 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:54,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:54,957 INFO L85 PathProgramCache]: Analyzing trace with hash 466036363, now seen corresponding path program 1 times [2024-10-11 13:58:54,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:54,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759865505] [2024-10-11 13:58:54,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:54,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:55,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:55,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:55,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:55,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759865505] [2024-10-11 13:58:55,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759865505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:55,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:55,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:58:55,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625230930] [2024-10-11 13:58:55,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:55,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:58:55,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:55,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:58:55,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:58:55,606 INFO L87 Difference]: Start difference. First operand 597 states and 768 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:55,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:55,977 INFO L93 Difference]: Finished difference Result 1181 states and 1508 transitions. [2024-10-11 13:58:55,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:58:55,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2024-10-11 13:58:55,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:55,981 INFO L225 Difference]: With dead ends: 1181 [2024-10-11 13:58:55,981 INFO L226 Difference]: Without dead ends: 647 [2024-10-11 13:58:55,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:55,983 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 147 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:55,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 506 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:58:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-10-11 13:58:56,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 582. [2024-10-11 13:58:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 533 states have (on average 1.2307692307692308) internal successors, (656), 533 states have internal predecessors, (656), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 748 transitions. [2024-10-11 13:58:56,021 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 748 transitions. Word has length 176 [2024-10-11 13:58:56,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:56,022 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 748 transitions. [2024-10-11 13:58:56,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:56,022 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 748 transitions. [2024-10-11 13:58:56,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 13:58:56,023 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:56,023 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:56,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 13:58:56,024 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:56,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:56,024 INFO L85 PathProgramCache]: Analyzing trace with hash 724201801, now seen corresponding path program 1 times [2024-10-11 13:58:56,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:56,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264831306] [2024-10-11 13:58:56,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:56,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:56,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:56,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264831306] [2024-10-11 13:58:56,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264831306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:56,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:56,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:58:56,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134570792] [2024-10-11 13:58:56,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:56,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:58:56,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:56,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:58:56,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:58:56,590 INFO L87 Difference]: Start difference. First operand 582 states and 748 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:56,947 INFO L93 Difference]: Finished difference Result 1151 states and 1468 transitions. [2024-10-11 13:58:56,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:58:56,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 176 [2024-10-11 13:58:56,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:56,951 INFO L225 Difference]: With dead ends: 1151 [2024-10-11 13:58:56,951 INFO L226 Difference]: Without dead ends: 632 [2024-10-11 13:58:56,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:56,952 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 149 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:56,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 429 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:58:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2024-10-11 13:58:56,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 565. [2024-10-11 13:58:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 516 states have (on average 1.2306201550387597) internal successors, (635), 516 states have internal predecessors, (635), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:58:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 727 transitions. [2024-10-11 13:58:56,990 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 727 transitions. Word has length 176 [2024-10-11 13:58:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:56,991 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 727 transitions. [2024-10-11 13:58:56,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:58:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 727 transitions. [2024-10-11 13:58:56,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 13:58:56,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:56,992 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:56,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 13:58:56,992 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:56,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:56,993 INFO L85 PathProgramCache]: Analyzing trace with hash -679942459, now seen corresponding path program 1 times [2024-10-11 13:58:56,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:56,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410399125] [2024-10-11 13:58:56,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:56,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:58:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:58:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:58:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:58:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:58:59,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:59,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410399125] [2024-10-11 13:58:59,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410399125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:59,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:59,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 13:58:59,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420272088] [2024-10-11 13:58:59,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:59,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 13:58:59,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:59,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 13:58:59,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:58:59,757 INFO L87 Difference]: Start difference. First operand 565 states and 727 transitions. Second operand has 16 states, 14 states have (on average 4.571428571428571) internal successors, (64), 16 states have internal predecessors, (64), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) [2024-10-11 13:59:00,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:59:00,855 INFO L93 Difference]: Finished difference Result 1115 states and 1425 transitions. [2024-10-11 13:59:00,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:59:00,855 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.571428571428571) internal successors, (64), 16 states have internal predecessors, (64), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) Word has length 176 [2024-10-11 13:59:00,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:59:00,858 INFO L225 Difference]: With dead ends: 1115 [2024-10-11 13:59:00,858 INFO L226 Difference]: Without dead ends: 613 [2024-10-11 13:59:00,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:59:00,860 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 366 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:59:00,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1041 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:59:00,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-10-11 13:59:00,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 546. [2024-10-11 13:59:00,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 497 states have (on average 1.2354124748490947) internal successors, (614), 497 states have internal predecessors, (614), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:59:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 706 transitions. [2024-10-11 13:59:00,918 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 706 transitions. Word has length 176 [2024-10-11 13:59:00,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:59:00,919 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 706 transitions. [2024-10-11 13:59:00,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.571428571428571) internal successors, (64), 16 states have internal predecessors, (64), 5 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 5 states have call successors, (23) [2024-10-11 13:59:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 706 transitions. [2024-10-11 13:59:00,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-11 13:59:00,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:59:00,924 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:59:00,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 13:59:00,925 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:59:00,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:59:00,925 INFO L85 PathProgramCache]: Analyzing trace with hash 121802831, now seen corresponding path program 1 times [2024-10-11 13:59:00,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:59:00,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426866511] [2024-10-11 13:59:00,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:59:00,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:59:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:59:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:59:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:59:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:59:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:59:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:59:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 13:59:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:59:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:59:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 13:59:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:59:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:59:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:59:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:59:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:59:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:59:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:59:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:59:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:59:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:59:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:59:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:59:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 13:59:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:01,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:59:01,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:59:01,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426866511] [2024-10-11 13:59:01,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426866511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:59:01,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:59:01,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:59:01,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971250916] [2024-10-11 13:59:01,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:59:01,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:59:01,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:59:01,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:59:01,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:59:01,080 INFO L87 Difference]: Start difference. First operand 546 states and 706 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:59:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:59:01,208 INFO L93 Difference]: Finished difference Result 1109 states and 1412 transitions. [2024-10-11 13:59:01,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:59:01,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2024-10-11 13:59:01,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:59:01,211 INFO L225 Difference]: With dead ends: 1109 [2024-10-11 13:59:01,211 INFO L226 Difference]: Without dead ends: 626 [2024-10-11 13:59:01,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:59:01,212 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 31 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:59:01,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 493 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:59:01,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-10-11 13:59:01,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 610. [2024-10-11 13:59:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 561 states have (on average 1.2192513368983957) internal successors, (684), 561 states have internal predecessors, (684), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:59:01,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 776 transitions. [2024-10-11 13:59:01,248 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 776 transitions. Word has length 177 [2024-10-11 13:59:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:59:01,248 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 776 transitions. [2024-10-11 13:59:01,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:59:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 776 transitions. [2024-10-11 13:59:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 13:59:01,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:59:01,250 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:59:01,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 13:59:01,250 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:59:01,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:59:01,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1745010886, now seen corresponding path program 1 times [2024-10-11 13:59:01,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:59:01,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029019108] [2024-10-11 13:59:01,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:59:01,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:59:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:59:01,307 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:59:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:59:01,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:59:01,513 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:59:01,514 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:59:01,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 13:59:01,519 INFO L407 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] [2024-10-11 13:59:01,685 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:59:01,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:59:01 BoogieIcfgContainer [2024-10-11 13:59:01,688 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:59:01,689 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:59:01,689 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:59:01,689 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:59:01,689 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:58:26" (3/4) ... [2024-10-11 13:59:01,692 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:59:01,693 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:59:01,694 INFO L158 Benchmark]: Toolchain (without parser) took 36916.17ms. Allocated memory was 174.1MB in the beginning and 1.1GB in the end (delta: 933.2MB). Free memory was 103.9MB in the beginning and 1.0GB in the end (delta: -925.0MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-10-11 13:59:01,694 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 113.2MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:59:01,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.64ms. Allocated memory is still 174.1MB. Free memory was 103.9MB in the beginning and 86.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:59:01,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.30ms. Allocated memory is still 174.1MB. Free memory was 86.4MB in the beginning and 82.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:59:01,695 INFO L158 Benchmark]: Boogie Preprocessor took 83.62ms. Allocated memory is still 174.1MB. Free memory was 82.7MB in the beginning and 78.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:59:01,695 INFO L158 Benchmark]: RCFGBuilder took 762.43ms. Allocated memory is still 174.1MB. Free memory was 78.2MB in the beginning and 112.0MB in the end (delta: -33.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 13:59:01,696 INFO L158 Benchmark]: TraceAbstraction took 35615.71ms. Allocated memory was 174.1MB in the beginning and 1.1GB in the end (delta: 933.2MB). Free memory was 111.1MB in the beginning and 1.0GB in the end (delta: -917.7MB). Peak memory consumption was 637.2MB. Max. memory is 16.1GB. [2024-10-11 13:59:01,696 INFO L158 Benchmark]: Witness Printer took 4.97ms. Allocated memory is still 1.1GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:59:01,697 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.22ms. Allocated memory is still 113.2MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.64ms. Allocated memory is still 174.1MB. Free memory was 103.9MB in the beginning and 86.4MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.30ms. Allocated memory is still 174.1MB. Free memory was 86.4MB in the beginning and 82.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.62ms. Allocated memory is still 174.1MB. Free memory was 82.7MB in the beginning and 78.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 762.43ms. Allocated memory is still 174.1MB. Free memory was 78.2MB in the beginning and 112.0MB in the end (delta: -33.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 35615.71ms. Allocated memory was 174.1MB in the beginning and 1.1GB in the end (delta: 933.2MB). Free memory was 111.1MB in the beginning and 1.0GB in the end (delta: -917.7MB). Peak memory consumption was 637.2MB. Max. memory is 16.1GB. * Witness Printer took 4.97ms. Allocated memory is still 1.1GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 143. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 16.6, 1, 1, 10.6, 0, 1, 0, 0, 10, 100, 64, 100, -4, 32, 4, 64 }; [L59] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L60] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L61] unsigned char* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L62] double* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L63] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L64] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L65] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L66] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L67] signed char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L68] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L69] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L70] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L71] signed char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L72] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L73] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L74] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L75] unsigned char last_1_WrapperStruct00_var_1_5 = 0; [L147] isInitial = 1 [L148] FCALL initially() [L149] COND TRUE 1 [L150] CALL updateLastVariables() [L140] EXPR WrapperStruct00.var_1_5 [L140] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L150] RET updateLastVariables() [L151] CALL updateVariables() [L103] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L106] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L109] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L110] EXPR WrapperStruct00.var_1_4 [L110] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_4 [L110] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L111] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L113] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L114] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L115] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L116] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L117] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L118] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L119] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L120] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L121] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L122] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L123] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L124] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 64) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 64) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L125] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L126] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L127] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L128] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L129] WrapperStruct00.var_1_14 = __VERIFIER_nondet_char() [L130] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L130] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L130] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L131] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L132] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L133] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L133] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L133] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L134] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L134] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L134] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L135] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L136] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L136] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L136] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L137] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L137] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L137] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L151] RET updateVariables() [L152] CALL step() [L79] COND FALSE !(\read(last_1_WrapperStruct00_var_1_5)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L84] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L84] COND FALSE !((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) [L87] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L87] (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L87] (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L87] COND TRUE (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) [L88] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L88] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L88] (*(WrapperStruct00_var_1_5_Pointer)) = (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))) [L92] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1) [L92] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L92] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L92] signed long int stepLocal_1 = ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1))); [L93] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L93] signed char stepLocal_0 = (*(WrapperStruct00_var_1_17_Pointer)); [L94] COND FALSE !(-10 >= stepLocal_0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L152] RET step() [L153] CALL, EXPR property() [L143] EXPR last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1 [L143] EXPR last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer)))))))) [L143] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L143] EXPR (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))) [L143] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L143] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L143] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) [L143] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1 [L143] EXPR (-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) [L143] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L143] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L143] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1 [L143] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L143] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L143] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143] EXPR (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L143-L144] return (((last_1_WrapperStruct00_var_1_5 ? (last_1_WrapperStruct00_var_1_5 ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_4_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((*(WrapperStruct00_var_1_3_Pointer)) || (256 >= ((*(WrapperStruct00_var_1_17_Pointer)) + 4))) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_2_Pointer)) || (*(WrapperStruct00_var_1_3_Pointer))) || (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (! (! ((*(WrapperStruct00_var_1_8_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))))))) && ((-10 >= (*(WrapperStruct00_var_1_17_Pointer))) ? (((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (((((*(WrapperStruct00_var_1_13_Pointer))) < (1)) ? ((*(WrapperStruct00_var_1_13_Pointer))) : (1)))) > (~ (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_14_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (- ((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_1_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) ; [L153] RET, EXPR property() [L153] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:22}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:25}, WrapperStruct00_var_1_14_Pointer={4:26}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:18}, WrapperStruct00_var_1_7_Pointer={4:19}, WrapperStruct00_var_1_8_Pointer={4:20}, WrapperStruct00_var_1_9_Pointer={4:21}, isInitial=1, last_1_WrapperStruct00_var_1_5=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.4s, OverallIterations: 37, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4587 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4583 mSDsluCounter, 20483 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14892 mSDsCounter, 287 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9700 IncrementalHoareTripleChecker+Invalid, 9987 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 287 mSolverCounterUnsat, 5591 mSDtfsCounter, 9700 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2041 GetRequests, 1778 SyntacticMatches, 4 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=610occurred in iteration=36, InterpolantAutomatonStates: 232, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 36 MinimizatonAttempts, 1083 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 20.6s InterpolantComputationTime, 6414 NumberOfCodeBlocks, 6414 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6199 ConstructedInterpolants, 0 QuantifiedInterpolants, 27534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 36432/36432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 13:59:01,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b7d4f9d78490f5290f13c8883d00adc73ba1976bc9e9ac925a881a19aea54245 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:59:03,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:59:04,034 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:59:04,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:59:04,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:59:04,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:59:04,082 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:59:04,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:59:04,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:59:04,084 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:59:04,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:59:04,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:59:04,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:59:04,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:59:04,088 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:59:04,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:59:04,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:59:04,089 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:59:04,089 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:59:04,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:59:04,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:59:04,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:59:04,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:59:04,093 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:59:04,094 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:59:04,094 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:59:04,094 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:59:04,094 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:59:04,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:59:04,095 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:59:04,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:59:04,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:59:04,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:59:04,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:59:04,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:59:04,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:59:04,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:59:04,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:59:04,097 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:59:04,097 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:59:04,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:59:04,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:59:04,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:59:04,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:59:04,098 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:59:04,098 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/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 -> b7d4f9d78490f5290f13c8883d00adc73ba1976bc9e9ac925a881a19aea54245 [2024-10-11 13:59:04,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:59:04,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:59:04,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:59:04,466 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:59:04,467 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:59:04,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i [2024-10-11 13:59:05,990 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:59:06,213 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:59:06,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i [2024-10-11 13:59:06,228 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/437536764/587cf7cce8264539b6714bb2a3c5571a/FLAG9fed22fdc [2024-10-11 13:59:06,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/437536764/587cf7cce8264539b6714bb2a3c5571a [2024-10-11 13:59:06,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:59:06,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:59:06,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:59:06,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:59:06,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:59:06,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:59:06" (1/1) ... [2024-10-11 13:59:06,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c29d0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:59:06, skipping insertion in model container [2024-10-11 13:59:06,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:59:06" (1/1) ... [2024-10-11 13:59:06,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:59:06,772 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i[917,930] [2024-10-11 13:59:06,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:59:06,880 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:59:06,892 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-34.i[917,930] [2024-10-11 13:59:06,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:59:06,988 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:59:06,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:59:06 WrapperNode [2024-10-11 13:59:06,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:59:06,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:59:06,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:59:06,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:59:06,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:59:06" (1/1) ... [2024-10-11 13:59:07,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:59:06" (1/1) ... [2024-10-11 13:59:07,071 INFO L138 Inliner]: procedures = 30, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 448 [2024-10-11 13:59:07,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:59:07,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:59:07,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:59:07,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:59:07,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:59:06" (1/1) ... [2024-10-11 13:59:07,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:59:06" (1/1) ... [2024-10-11 13:59:07,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:59:06" (1/1) ... [2024-10-11 13:59:07,126 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 18 writes are split as follows [0, 18]. [2024-10-11 13:59:07,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:59:06" (1/1) ... [2024-10-11 13:59:07,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:59:06" (1/1) ... [2024-10-11 13:59:07,151 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:59:06" (1/1) ... [2024-10-11 13:59:07,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:59:06" (1/1) ... [2024-10-11 13:59:07,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:59:06" (1/1) ... [2024-10-11 13:59:07,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:59:06" (1/1) ... [2024-10-11 13:59:07,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:59:07,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:59:07,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:59:07,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:59:07,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:59:06" (1/1) ... [2024-10-11 13:59:07,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:59:07,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:59:07,200 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:59:07,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:59:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:59:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 13:59:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 13:59:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 13:59:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 13:59:07,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:59:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:59:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:59:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:59:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 13:59:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 13:59:07,247 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:59:07,248 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:59:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:59:07,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:59:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:59:07,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:59:07,367 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:59:07,368 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:59:17,909 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2024-10-11 13:59:17,909 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:59:17,964 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:59:17,966 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:59:17,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:59:17 BoogieIcfgContainer [2024-10-11 13:59:17,966 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:59:17,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:59:17,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:59:17,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:59:17,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:59:06" (1/3) ... [2024-10-11 13:59:17,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60cb07fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:59:17, skipping insertion in model container [2024-10-11 13:59:17,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:59:06" (2/3) ... [2024-10-11 13:59:17,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60cb07fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:59:17, skipping insertion in model container [2024-10-11 13:59:17,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:59:17" (3/3) ... [2024-10-11 13:59:17,976 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-34.i [2024-10-11 13:59:17,992 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:59:17,992 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:59:18,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:59:18,064 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;@7f7be4c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:59:18,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:59:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:59:18,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 13:59:18,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:59:18,082 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:59:18,083 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:59:18,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:59:18,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1982887210, now seen corresponding path program 1 times [2024-10-11 13:59:18,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:59:18,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774516780] [2024-10-11 13:59:18,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:59:18,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:59:18,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:59:18,124 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:59:18,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 13:59:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:18,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:59:18,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:59:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 492 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2024-10-11 13:59:18,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:59:18,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:59:18,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774516780] [2024-10-11 13:59:18,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774516780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:59:18,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:59:18,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:59:18,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997284442] [2024-10-11 13:59:18,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:59:18,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:59:18,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:59:18,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:59:18,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:59:18,659 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 13:59:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:59:18,717 INFO L93 Difference]: Finished difference Result 223 states and 357 transitions. [2024-10-11 13:59:18,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:59:18,720 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2024-10-11 13:59:18,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:59:18,731 INFO L225 Difference]: With dead ends: 223 [2024-10-11 13:59:18,731 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 13:59:18,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:59:18,738 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:59:18,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:59:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 13:59:18,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 13:59:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:59:18,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2024-10-11 13:59:18,806 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 166 [2024-10-11 13:59:18,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:59:18,806 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2024-10-11 13:59:18,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 13:59:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2024-10-11 13:59:18,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 13:59:18,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:59:18,811 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:59:18,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:59:19,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:59:19,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:59:19,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:59:19,018 INFO L85 PathProgramCache]: Analyzing trace with hash 799028980, now seen corresponding path program 1 times [2024-10-11 13:59:19,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:59:19,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735452038] [2024-10-11 13:59:19,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:59:19,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:59:19,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:59:19,023 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:59:19,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 13:59:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:19,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 13:59:19,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:59:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:59:19,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:59:19,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:59:19,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735452038] [2024-10-11 13:59:19,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735452038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:59:19,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:59:19,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:59:19,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352295557] [2024-10-11 13:59:19,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:59:19,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:59:19,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:59:19,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:59:19,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:59:19,456 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:59:19,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:59:19,534 INFO L93 Difference]: Finished difference Result 219 states and 322 transitions. [2024-10-11 13:59:19,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:59:19,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2024-10-11 13:59:19,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:59:19,538 INFO L225 Difference]: With dead ends: 219 [2024-10-11 13:59:19,538 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 13:59:19,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:59:19,540 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:59:19,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:59:19,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 13:59:19,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-11 13:59:19,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:59:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2024-10-11 13:59:19,554 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 166 [2024-10-11 13:59:19,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:59:19,556 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2024-10-11 13:59:19,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:59:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2024-10-11 13:59:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 13:59:19,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:59:19,559 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:59:19,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 13:59:19,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:59:19,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:59:19,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:59:19,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1403213728, now seen corresponding path program 1 times [2024-10-11 13:59:19,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:59:19,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930784253] [2024-10-11 13:59:19,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:59:19,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:59:19,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:59:19,763 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:59:19,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 13:59:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:20,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:59:20,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:59:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:59:20,298 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:59:20,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:59:20,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930784253] [2024-10-11 13:59:20,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930784253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:59:20,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:59:20,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:59:20,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410953484] [2024-10-11 13:59:20,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:59:20,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:59:20,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:59:20,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:59:20,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:59:20,304 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:59:20,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:59:20,436 INFO L93 Difference]: Finished difference Result 219 states and 320 transitions. [2024-10-11 13:59:20,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:59:20,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 168 [2024-10-11 13:59:20,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:59:20,442 INFO L225 Difference]: With dead ends: 219 [2024-10-11 13:59:20,442 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 13:59:20,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:59:20,448 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:59:20,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:59:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 13:59:20,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 13:59:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 13:59:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2024-10-11 13:59:20,464 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 168 [2024-10-11 13:59:20,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:59:20,465 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2024-10-11 13:59:20,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:59:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2024-10-11 13:59:20,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 13:59:20,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:59:20,467 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:59:20,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 13:59:20,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:59:20,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:59:20,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:59:20,672 INFO L85 PathProgramCache]: Analyzing trace with hash -165501938, now seen corresponding path program 1 times [2024-10-11 13:59:20,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:59:20,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808407320] [2024-10-11 13:59:20,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:59:20,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:59:20,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:59:20,676 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:59:20,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 13:59:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:21,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:59:21,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:59:21,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-11 13:59:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:59:22,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:59:22,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:59:22,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808407320] [2024-10-11 13:59:22,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808407320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:59:22,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:59:22,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:59:22,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982444160] [2024-10-11 13:59:22,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:59:22,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:59:22,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:59:22,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:59:22,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:59:22,076 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:59:24,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:59:25,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:59:26,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:59:26,043 INFO L93 Difference]: Finished difference Result 333 states and 483 transitions. [2024-10-11 13:59:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:59:26,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 170 [2024-10-11 13:59:26,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:59:26,046 INFO L225 Difference]: With dead ends: 333 [2024-10-11 13:59:26,046 INFO L226 Difference]: Without dead ends: 223 [2024-10-11 13:59:26,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:59:26,052 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 91 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:59:26,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 370 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 13:59:26,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-11 13:59:26,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 184. [2024-10-11 13:59:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 135 states have (on average 1.288888888888889) internal successors, (174), 135 states have internal predecessors, (174), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:59:26,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 266 transitions. [2024-10-11 13:59:26,092 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 266 transitions. Word has length 170 [2024-10-11 13:59:26,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:59:26,093 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 266 transitions. [2024-10-11 13:59:26,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:59:26,094 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 266 transitions. [2024-10-11 13:59:26,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 13:59:26,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:59:26,099 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:59:26,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 13:59:26,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:59:26,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:59:26,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:59:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1516518554, now seen corresponding path program 1 times [2024-10-11 13:59:26,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:59:26,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572571462] [2024-10-11 13:59:26,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:59:26,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:59:26,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:59:26,305 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:59:26,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 13:59:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:26,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 13:59:26,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:59:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:59:26,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:59:26,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:59:26,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572571462] [2024-10-11 13:59:26,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572571462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:59:26,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:59:26,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:59:26,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650754136] [2024-10-11 13:59:26,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:59:26,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:59:26,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:59:26,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:59:26,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:59:26,709 INFO L87 Difference]: Start difference. First operand 184 states and 266 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:59:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:59:26,776 INFO L93 Difference]: Finished difference Result 308 states and 446 transitions. [2024-10-11 13:59:26,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:59:26,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2024-10-11 13:59:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:59:26,779 INFO L225 Difference]: With dead ends: 308 [2024-10-11 13:59:26,779 INFO L226 Difference]: Without dead ends: 182 [2024-10-11 13:59:26,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:59:26,781 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:59:26,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:59:26,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-11 13:59:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-10-11 13:59:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 133 states have internal predecessors, (170), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:59:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 262 transitions. [2024-10-11 13:59:26,798 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 262 transitions. Word has length 173 [2024-10-11 13:59:26,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:59:26,798 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 262 transitions. [2024-10-11 13:59:26,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:59:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 262 transitions. [2024-10-11 13:59:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 13:59:26,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:59:26,801 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:59:26,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 13:59:27,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:59:27,002 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:59:27,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:59:27,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1906828626, now seen corresponding path program 1 times [2024-10-11 13:59:27,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:59:27,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409621462] [2024-10-11 13:59:27,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:59:27,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:59:27,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:59:27,004 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:59:27,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (7)] Waiting until timeout for monitored process [2024-10-11 13:59:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:27,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 13:59:27,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:59:27,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:59:27,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-11 13:59:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:59:27,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:59:27,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:59:27,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409621462] [2024-10-11 13:59:27,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409621462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:59:27,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:59:27,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:59:27,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784711618] [2024-10-11 13:59:27,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:59:27,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:59:27,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:59:27,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:59:27,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:59:27,817 INFO L87 Difference]: Start difference. First operand 182 states and 262 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:59:30,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:59:31,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:59:31,099 INFO L93 Difference]: Finished difference Result 365 states and 523 transitions. [2024-10-11 13:59:31,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:59:31,100 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2024-10-11 13:59:31,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:59:31,102 INFO L225 Difference]: With dead ends: 365 [2024-10-11 13:59:31,102 INFO L226 Difference]: Without dead ends: 241 [2024-10-11 13:59:31,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:59:31,103 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 52 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:59:31,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 927 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 13:59:31,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-11 13:59:31,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 219. [2024-10-11 13:59:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 170 states have (on average 1.2823529411764707) internal successors, (218), 170 states have internal predecessors, (218), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:59:31,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 310 transitions. [2024-10-11 13:59:31,136 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 310 transitions. Word has length 175 [2024-10-11 13:59:31,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:59:31,136 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 310 transitions. [2024-10-11 13:59:31,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 13:59:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 310 transitions. [2024-10-11 13:59:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 13:59:31,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:59:31,140 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:59:31,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (7)] Ended with exit code 0 [2024-10-11 13:59:31,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:59:31,341 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:59:31,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:59:31,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2041690198, now seen corresponding path program 1 times [2024-10-11 13:59:31,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:59:31,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335127924] [2024-10-11 13:59:31,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:59:31,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 13:59:31,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:59:31,344 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 13:59:31,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (8)] Waiting until timeout for monitored process [2024-10-11 13:59:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:31,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:59:31,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:59:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 13:59:31,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:59:31,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:59:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335127924] [2024-10-11 13:59:31,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335127924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:59:31,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:59:31,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:59:31,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860887627] [2024-10-11 13:59:31,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:59:31,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:59:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:59:31,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:59:31,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:59:31,910 INFO L87 Difference]: Start difference. First operand 219 states and 310 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)