./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-2.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-2.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 c554ccc5a601f8437729d4334efbdb5f23a6f490bc0338089a1c3e75130cdbec --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:56:28,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:56:28,594 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:56:28,600 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:56:28,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:56:28,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:56:28,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:56:28,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:56:28,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:56:28,627 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:56:28,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:56:28,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:56:28,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:56:28,633 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:56:28,634 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:56:28,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:56:28,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:56:28,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:56:28,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:56:28,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:56:28,635 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:56:28,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:56:28,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:56:28,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:56:28,639 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:56:28,639 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:56:28,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:56:28,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:56:28,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:56:28,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:56:28,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:56:28,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:56:28,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:56:28,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:56:28,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:56:28,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:56:28,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:56:28,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:56:28,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:56:28,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:56:28,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:56:28,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:56:28,645 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 -> c554ccc5a601f8437729d4334efbdb5f23a6f490bc0338089a1c3e75130cdbec [2024-10-11 13:56:28,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:56:28,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:56:28,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:56:28,933 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:56:28,934 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:56:28,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i [2024-10-11 13:56:30,402 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:56:30,612 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:56:30,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i [2024-10-11 13:56:30,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b5c085517/33b57652f4664443a81e3014d72cefcb/FLAGafb408a80 [2024-10-11 13:56:30,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b5c085517/33b57652f4664443a81e3014d72cefcb [2024-10-11 13:56:30,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:56:30,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:56:30,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:56:30,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:56:30,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:56:30,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:56:30" (1/1) ... [2024-10-11 13:56:30,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ac2195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:30, skipping insertion in model container [2024-10-11 13:56:30,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:56:30" (1/1) ... [2024-10-11 13:56:30,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:56:30,829 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-2.i[916,929] [2024-10-11 13:56:30,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:56:30,900 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:56:30,912 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-2.i[916,929] [2024-10-11 13:56:30,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:56:30,989 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:56:30,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:30 WrapperNode [2024-10-11 13:56:30,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:56:30,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:56:30,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:56:30,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:56:30,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:56:30" (1/1) ... [2024-10-11 13:56:31,014 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:56:30" (1/1) ... [2024-10-11 13:56:31,051 INFO L138 Inliner]: procedures = 29, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 520 [2024-10-11 13:56:31,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:56:31,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:56:31,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:56:31,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:56:31,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:30" (1/1) ... [2024-10-11 13:56:31,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:30" (1/1) ... [2024-10-11 13:56:31,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:30" (1/1) ... [2024-10-11 13:56:31,098 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 15 writes are split as follows [0, 15]. [2024-10-11 13:56:31,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:30" (1/1) ... [2024-10-11 13:56:31,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:30" (1/1) ... [2024-10-11 13:56:31,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:30" (1/1) ... [2024-10-11 13:56:31,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:30" (1/1) ... [2024-10-11 13:56:31,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:30" (1/1) ... [2024-10-11 13:56:31,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:30" (1/1) ... [2024-10-11 13:56:31,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:56:31,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:56:31,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:56:31,133 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:56:31,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:30" (1/1) ... [2024-10-11 13:56:31,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:56:31,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:56:31,174 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:56:31,180 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:56:31,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:56:31,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:56:31,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:56:31,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:56:31,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:56:31,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:56:31,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:56:31,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:56:31,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:56:31,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:56:31,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:56:31,241 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:56:31,241 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:56:31,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:56:31,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:56:31,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:56:31,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:56:31,395 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:56:31,398 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:56:31,973 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-11 13:56:31,974 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:56:32,014 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:56:32,016 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:56:32,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:56:32 BoogieIcfgContainer [2024-10-11 13:56:32,017 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:56:32,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:56:32,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:56:32,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:56:32,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:56:30" (1/3) ... [2024-10-11 13:56:32,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff3fb3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:56:32, skipping insertion in model container [2024-10-11 13:56:32,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:30" (2/3) ... [2024-10-11 13:56:32,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff3fb3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:56:32, skipping insertion in model container [2024-10-11 13:56:32,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:56:32" (3/3) ... [2024-10-11 13:56:32,028 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-2.i [2024-10-11 13:56:32,047 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:56:32,047 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:56:32,119 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:56:32,125 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;@1473fe83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:56:32,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:56:32,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 82 states have (on average 1.5) internal successors, (123), 83 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:56:32,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 13:56:32,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:32,144 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:32,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:32,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:32,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2140966655, now seen corresponding path program 1 times [2024-10-11 13:56:32,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:32,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446032037] [2024-10-11 13:56:32,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:32,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:56:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:32,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:32,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446032037] [2024-10-11 13:56:32,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446032037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:32,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:32,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:56:32,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413096630] [2024-10-11 13:56:32,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:32,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:56:32,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:32,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:56:32,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:56:32,622 INFO L87 Difference]: Start difference. First operand has 97 states, 82 states have (on average 1.5) internal successors, (123), 83 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:56:32,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:32,668 INFO L93 Difference]: Finished difference Result 191 states and 304 transitions. [2024-10-11 13:56:32,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:56:32,671 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-11 13:56:32,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:32,681 INFO L225 Difference]: With dead ends: 191 [2024-10-11 13:56:32,682 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 13:56:32,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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:56:32,692 INFO L432 NwaCegarLoop]: 138 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, 138 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:56:32,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:56:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 13:56:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-11 13:56:32,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 81 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:56:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 142 transitions. [2024-10-11 13:56:32,744 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 142 transitions. Word has length 95 [2024-10-11 13:56:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:32,746 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 142 transitions. [2024-10-11 13:56:32,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:56:32,748 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 142 transitions. [2024-10-11 13:56:32,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 13:56:32,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:32,755 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:32,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:56:32,756 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:32,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:32,757 INFO L85 PathProgramCache]: Analyzing trace with hash 99507669, now seen corresponding path program 1 times [2024-10-11 13:56:32,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:32,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723059349] [2024-10-11 13:56:32,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:32,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:32,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:56:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:33,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:33,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723059349] [2024-10-11 13:56:33,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723059349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:33,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:33,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:56:33,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008567035] [2024-10-11 13:56:33,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:33,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:56:33,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:33,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:56:33,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:56:33,047 INFO L87 Difference]: Start difference. First operand 95 states and 142 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:33,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:33,090 INFO L93 Difference]: Finished difference Result 190 states and 285 transitions. [2024-10-11 13:56:33,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:56:33,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2024-10-11 13:56:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:33,093 INFO L225 Difference]: With dead ends: 190 [2024-10-11 13:56:33,093 INFO L226 Difference]: Without dead ends: 96 [2024-10-11 13:56:33,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:56:33,095 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 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:56:33,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:56:33,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-11 13:56:33,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-11 13:56:33,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.451219512195122) internal successors, (119), 82 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:56:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 143 transitions. [2024-10-11 13:56:33,106 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 143 transitions. Word has length 95 [2024-10-11 13:56:33,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:33,108 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 143 transitions. [2024-10-11 13:56:33,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:33,109 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 143 transitions. [2024-10-11 13:56:33,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 13:56:33,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:33,111 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:33,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:56:33,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:33,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:33,112 INFO L85 PathProgramCache]: Analyzing trace with hash -487298345, now seen corresponding path program 1 times [2024-10-11 13:56:33,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:33,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140111922] [2024-10-11 13:56:33,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:33,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:56:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:33,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:33,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140111922] [2024-10-11 13:56:33,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140111922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:33,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:33,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:56:33,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195111092] [2024-10-11 13:56:33,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:33,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:56:33,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:33,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:56:33,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:56:33,304 INFO L87 Difference]: Start difference. First operand 96 states and 143 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:56:33,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:33,368 INFO L93 Difference]: Finished difference Result 193 states and 288 transitions. [2024-10-11 13:56:33,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:56:33,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-11 13:56:33,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:33,371 INFO L225 Difference]: With dead ends: 193 [2024-10-11 13:56:33,371 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 13:56:33,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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:56:33,373 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 401 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:56:33,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 401 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:56:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 13:56:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-11 13:56:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 84 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:56:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 145 transitions. [2024-10-11 13:56:33,389 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 145 transitions. Word has length 95 [2024-10-11 13:56:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:33,390 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 145 transitions. [2024-10-11 13:56:33,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:56:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 145 transitions. [2024-10-11 13:56:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 13:56:33,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:33,393 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:33,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:56:33,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:33,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:33,397 INFO L85 PathProgramCache]: Analyzing trace with hash -414911787, now seen corresponding path program 1 times [2024-10-11 13:56:33,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:33,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820447021] [2024-10-11 13:56:33,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:33,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:56:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,681 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:33,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:33,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820447021] [2024-10-11 13:56:33,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820447021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:33,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:33,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:56:33,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412968766] [2024-10-11 13:56:33,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:33,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:56:33,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:33,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:56:33,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:56:33,684 INFO L87 Difference]: Start difference. First operand 98 states and 145 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:33,728 INFO L93 Difference]: Finished difference Result 197 states and 292 transitions. [2024-10-11 13:56:33,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:56:33,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2024-10-11 13:56:33,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:33,734 INFO L225 Difference]: With dead ends: 197 [2024-10-11 13:56:33,735 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 13:56:33,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 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:56:33,736 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 401 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:56:33,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 401 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:56:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 13:56:33,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 13:56:33,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.430232558139535) internal successors, (123), 86 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:56:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2024-10-11 13:56:33,749 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 95 [2024-10-11 13:56:33,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:33,750 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2024-10-11 13:56:33,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:33,750 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2024-10-11 13:56:33,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:56:33,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:33,752 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:33,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:56:33,752 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:33,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:33,753 INFO L85 PathProgramCache]: Analyzing trace with hash -661592873, now seen corresponding path program 1 times [2024-10-11 13:56:33,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:33,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895429103] [2024-10-11 13:56:33,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:33,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:56:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:33,873 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:33,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:33,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895429103] [2024-10-11 13:56:33,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895429103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:33,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:33,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:56:33,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982082167] [2024-10-11 13:56:33,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:33,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:56:33,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:33,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:56:33,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:56:33,881 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:34,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:34,049 INFO L93 Difference]: Finished difference Result 243 states and 359 transitions. [2024-10-11 13:56:34,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:56:34,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2024-10-11 13:56:34,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:34,052 INFO L225 Difference]: With dead ends: 243 [2024-10-11 13:56:34,052 INFO L226 Difference]: Without dead ends: 144 [2024-10-11 13:56:34,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:56:34,054 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 59 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:34,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 271 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:56:34,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-11 13:56:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 118. [2024-10-11 13:56:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:56:34,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 175 transitions. [2024-10-11 13:56:34,069 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 175 transitions. Word has length 98 [2024-10-11 13:56:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:34,069 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 175 transitions. [2024-10-11 13:56:34,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 175 transitions. [2024-10-11 13:56:34,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:56:34,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:34,071 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:34,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:56:34,071 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:34,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:34,072 INFO L85 PathProgramCache]: Analyzing trace with hash 295404210, now seen corresponding path program 1 times [2024-10-11 13:56:34,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:34,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793006006] [2024-10-11 13:56:34,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:34,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:56:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:34,159 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:34,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:34,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793006006] [2024-10-11 13:56:34,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793006006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:34,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:34,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:56:34,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745738489] [2024-10-11 13:56:34,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:34,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:56:34,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:34,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:56:34,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:56:34,161 INFO L87 Difference]: Start difference. First operand 118 states and 175 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:34,192 INFO L93 Difference]: Finished difference Result 236 states and 351 transitions. [2024-10-11 13:56:34,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:56:34,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2024-10-11 13:56:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:34,194 INFO L225 Difference]: With dead ends: 236 [2024-10-11 13:56:34,194 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 13:56:34,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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:56:34,195 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 269 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:56:34,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:56:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 13:56:34,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-11 13:56:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:56:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 176 transitions. [2024-10-11 13:56:34,215 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 176 transitions. Word has length 98 [2024-10-11 13:56:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:34,216 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 176 transitions. [2024-10-11 13:56:34,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 176 transitions. [2024-10-11 13:56:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 13:56:34,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:34,217 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:34,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:56:34,218 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:34,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:34,219 INFO L85 PathProgramCache]: Analyzing trace with hash -513942416, now seen corresponding path program 1 times [2024-10-11 13:56:34,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:34,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740810451] [2024-10-11 13:56:34,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:34,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:36,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:36,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:36,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:36,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:36,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:36,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:36,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:36,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:36,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:36,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:36,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:36,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:56:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:36,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:36,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:36,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740810451] [2024-10-11 13:56:36,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740810451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:36,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:36,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:56:36,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857032481] [2024-10-11 13:56:36,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:36,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:56:36,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:36,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:56:36,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:56:36,513 INFO L87 Difference]: Start difference. First operand 119 states and 176 transitions. Second operand has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:56:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:37,292 INFO L93 Difference]: Finished difference Result 290 states and 427 transitions. [2024-10-11 13:56:37,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:56:37,292 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 98 [2024-10-11 13:56:37,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:37,294 INFO L225 Difference]: With dead ends: 290 [2024-10-11 13:56:37,294 INFO L226 Difference]: Without dead ends: 172 [2024-10-11 13:56:37,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:56:37,295 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 231 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:37,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 500 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:56:37,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-11 13:56:37,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 147. [2024-10-11 13:56:37,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 133 states have (on average 1.4511278195488722) internal successors, (193), 133 states have internal predecessors, (193), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:56:37,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2024-10-11 13:56:37,307 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 98 [2024-10-11 13:56:37,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:37,307 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2024-10-11 13:56:37,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 11 states have internal predecessors, (41), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:56:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2024-10-11 13:56:37,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 13:56:37,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:37,309 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:37,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:56:37,309 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:37,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:37,311 INFO L85 PathProgramCache]: Analyzing trace with hash -684137499, now seen corresponding path program 1 times [2024-10-11 13:56:37,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:37,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330630864] [2024-10-11 13:56:37,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:37,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:56:37,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [869375358] [2024-10-11 13:56:37,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:37,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:56:37,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:56:37,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:56:37,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:56:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:37,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:56:37,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:56:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:37,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:56:37,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:37,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330630864] [2024-10-11 13:56:37,867 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 13:56:37,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869375358] [2024-10-11 13:56:37,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869375358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:37,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:37,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:56:37,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706524751] [2024-10-11 13:56:37,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:37,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:56:37,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:37,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:56:37,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:56:37,870 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:38,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:38,074 INFO L93 Difference]: Finished difference Result 411 states and 608 transitions. [2024-10-11 13:56:38,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:56:38,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-10-11 13:56:38,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:38,077 INFO L225 Difference]: With dead ends: 411 [2024-10-11 13:56:38,077 INFO L226 Difference]: Without dead ends: 265 [2024-10-11 13:56:38,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 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:56:38,078 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 126 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:38,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 323 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:56:38,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-11 13:56:38,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 219. [2024-10-11 13:56:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 192 states have (on average 1.4270833333333333) internal successors, (274), 192 states have internal predecessors, (274), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:56:38,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 322 transitions. [2024-10-11 13:56:38,110 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 322 transitions. Word has length 100 [2024-10-11 13:56:38,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:38,111 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 322 transitions. [2024-10-11 13:56:38,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:38,111 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 322 transitions. [2024-10-11 13:56:38,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 13:56:38,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:38,113 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:38,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:56:38,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:56:38,314 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:38,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:38,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1809144353, now seen corresponding path program 1 times [2024-10-11 13:56:38,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:38,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056685764] [2024-10-11 13:56:38,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:38,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:56:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:42,715 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:42,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:42,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056685764] [2024-10-11 13:56:42,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056685764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:42,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:42,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 13:56:42,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358400604] [2024-10-11 13:56:42,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:42,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 13:56:42,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:42,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 13:56:42,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:56:42,718 INFO L87 Difference]: Start difference. First operand 219 states and 322 transitions. Second operand has 14 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 14 states have internal predecessors, (44), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:56:44,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:44,192 INFO L93 Difference]: Finished difference Result 473 states and 699 transitions. [2024-10-11 13:56:44,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:56:44,193 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 14 states have internal predecessors, (44), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 101 [2024-10-11 13:56:44,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:44,194 INFO L225 Difference]: With dead ends: 473 [2024-10-11 13:56:44,194 INFO L226 Difference]: Without dead ends: 327 [2024-10-11 13:56:44,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:56:44,198 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 507 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:44,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 497 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 13:56:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-11 13:56:44,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 279. [2024-10-11 13:56:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 252 states have (on average 1.4523809523809523) internal successors, (366), 252 states have internal predecessors, (366), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:56:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 414 transitions. [2024-10-11 13:56:44,235 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 414 transitions. Word has length 101 [2024-10-11 13:56:44,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:44,235 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 414 transitions. [2024-10-11 13:56:44,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 14 states have internal predecessors, (44), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:56:44,236 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 414 transitions. [2024-10-11 13:56:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 13:56:44,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:44,237 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:44,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:56:44,237 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:44,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1416117343, now seen corresponding path program 1 times [2024-10-11 13:56:44,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:44,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843151256] [2024-10-11 13:56:44,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:44,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:45,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:56:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:45,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:45,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843151256] [2024-10-11 13:56:45,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843151256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:45,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:45,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:56:45,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891726651] [2024-10-11 13:56:45,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:45,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:56:45,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:45,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:56:45,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:56:45,574 INFO L87 Difference]: Start difference. First operand 279 states and 414 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:46,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:46,632 INFO L93 Difference]: Finished difference Result 618 states and 919 transitions. [2024-10-11 13:56:46,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 13:56:46,633 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2024-10-11 13:56:46,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:46,636 INFO L225 Difference]: With dead ends: 618 [2024-10-11 13:56:46,636 INFO L226 Difference]: Without dead ends: 441 [2024-10-11 13:56:46,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:56:46,637 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 252 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:46,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 688 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:56:46,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-10-11 13:56:46,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 391. [2024-10-11 13:56:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 364 states have (on average 1.478021978021978) internal successors, (538), 364 states have internal predecessors, (538), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:56:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 586 transitions. [2024-10-11 13:56:46,670 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 586 transitions. Word has length 101 [2024-10-11 13:56:46,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:46,670 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 586 transitions. [2024-10-11 13:56:46,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 586 transitions. [2024-10-11 13:56:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:56:46,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:46,673 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:46,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:56:46,673 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:46,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:46,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1139703579, now seen corresponding path program 1 times [2024-10-11 13:56:46,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:46,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123025117] [2024-10-11 13:56:46,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:46,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:56:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:47,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:47,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123025117] [2024-10-11 13:56:47,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123025117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:47,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:47,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:56:47,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648867284] [2024-10-11 13:56:47,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:47,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:56:47,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:47,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:56:47,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:56:47,036 INFO L87 Difference]: Start difference. First operand 391 states and 586 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:47,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:47,268 INFO L93 Difference]: Finished difference Result 680 states and 1017 transitions. [2024-10-11 13:56:47,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:56:47,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-11 13:56:47,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:47,271 INFO L225 Difference]: With dead ends: 680 [2024-10-11 13:56:47,272 INFO L226 Difference]: Without dead ends: 443 [2024-10-11 13:56:47,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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:56:47,273 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 44 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:47,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 403 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:56:47,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-11 13:56:47,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 397. [2024-10-11 13:56:47,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 370 states have (on average 1.481081081081081) internal successors, (548), 370 states have internal predecessors, (548), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:56:47,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 596 transitions. [2024-10-11 13:56:47,301 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 596 transitions. Word has length 103 [2024-10-11 13:56:47,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:47,302 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 596 transitions. [2024-10-11 13:56:47,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:56:47,302 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 596 transitions. [2024-10-11 13:56:47,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:56:47,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:47,303 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:47,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 13:56:47,304 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:47,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:47,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1532730589, now seen corresponding path program 1 times [2024-10-11 13:56:47,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:47,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952341182] [2024-10-11 13:56:47,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:47,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:56:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:49,247 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:49,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:49,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952341182] [2024-10-11 13:56:49,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952341182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:49,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:49,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 13:56:49,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601374355] [2024-10-11 13:56:49,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:49,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:56:49,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:49,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:56:49,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:56:49,250 INFO L87 Difference]: Start difference. First operand 397 states and 596 transitions. Second operand has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:56:50,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:50,209 INFO L93 Difference]: Finished difference Result 680 states and 1019 transitions. [2024-10-11 13:56:50,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:56:50,210 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-10-11 13:56:50,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:50,212 INFO L225 Difference]: With dead ends: 680 [2024-10-11 13:56:50,213 INFO L226 Difference]: Without dead ends: 437 [2024-10-11 13:56:50,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:56:50,214 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 349 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:50,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 471 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:56:50,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-10-11 13:56:50,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 399. [2024-10-11 13:56:50,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 372 states have (on average 1.478494623655914) internal successors, (550), 372 states have internal predecessors, (550), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:56:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 598 transitions. [2024-10-11 13:56:50,255 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 598 transitions. Word has length 103 [2024-10-11 13:56:50,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:50,255 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 598 transitions. [2024-10-11 13:56:50,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:56:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 598 transitions. [2024-10-11 13:56:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:56:50,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:50,257 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:50,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:56:50,258 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:50,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:50,258 INFO L85 PathProgramCache]: Analyzing trace with hash 497109669, now seen corresponding path program 1 times [2024-10-11 13:56:50,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:50,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231471780] [2024-10-11 13:56:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:50,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:52,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:52,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:52,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:52,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:52,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:52,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:52,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:52,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:52,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:52,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:52,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:56:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:52,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:52,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:52,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231471780] [2024-10-11 13:56:52,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231471780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:52,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:52,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:56:52,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869213173] [2024-10-11 13:56:52,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:52,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:56:52,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:52,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:56:52,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:56:52,333 INFO L87 Difference]: Start difference. First operand 399 states and 598 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:56:53,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:53,338 INFO L93 Difference]: Finished difference Result 702 states and 1052 transitions. [2024-10-11 13:56:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:56:53,339 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-10-11 13:56:53,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:53,343 INFO L225 Difference]: With dead ends: 702 [2024-10-11 13:56:53,343 INFO L226 Difference]: Without dead ends: 445 [2024-10-11 13:56:53,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:56:53,344 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 156 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:53,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 423 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:56:53,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-11 13:56:53,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 433. [2024-10-11 13:56:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 406 states have (on average 1.4532019704433496) internal successors, (590), 406 states have internal predecessors, (590), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:56:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 638 transitions. [2024-10-11 13:56:53,381 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 638 transitions. Word has length 103 [2024-10-11 13:56:53,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:53,381 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 638 transitions. [2024-10-11 13:56:53,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:56:53,382 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 638 transitions. [2024-10-11 13:56:53,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:56:53,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:53,383 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:53,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 13:56:53,383 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:53,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:53,384 INFO L85 PathProgramCache]: Analyzing trace with hash -320538781, now seen corresponding path program 1 times [2024-10-11 13:56:53,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:53,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875689795] [2024-10-11 13:56:53,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:53,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:55,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:55,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:55,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:55,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:55,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:55,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:55,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:55,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:55,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:55,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:55,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:55,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:56:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:55,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:55,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:55,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875689795] [2024-10-11 13:56:55,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875689795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:55,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:55,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 13:56:55,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785339411] [2024-10-11 13:56:55,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:55,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:56:55,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:55,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:56:55,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:56:55,240 INFO L87 Difference]: Start difference. First operand 433 states and 638 transitions. Second operand has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:56:56,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:56,366 INFO L93 Difference]: Finished difference Result 743 states and 1093 transitions. [2024-10-11 13:56:56,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:56:56,367 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-10-11 13:56:56,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:56,369 INFO L225 Difference]: With dead ends: 743 [2024-10-11 13:56:56,369 INFO L226 Difference]: Without dead ends: 481 [2024-10-11 13:56:56,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:56:56,371 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 348 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:56,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 713 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 13:56:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-10-11 13:56:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 435. [2024-10-11 13:56:56,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 408 states have (on average 1.4509803921568627) internal successors, (592), 408 states have internal predecessors, (592), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:56:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 640 transitions. [2024-10-11 13:56:56,398 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 640 transitions. Word has length 103 [2024-10-11 13:56:56,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:56,398 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 640 transitions. [2024-10-11 13:56:56,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:56:56,399 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 640 transitions. [2024-10-11 13:56:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:56:56,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:56,400 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:56,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 13:56:56,400 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:56,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:56,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1851921724, now seen corresponding path program 1 times [2024-10-11 13:56:56,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:56,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406992556] [2024-10-11 13:56:56,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:56,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:56,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:58,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:56:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:58,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:56:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:58,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:56:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:58,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:56:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:58,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:56:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:58,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:56:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:58,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:56:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:58,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:56:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:58,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:56:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:58,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:56:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:58,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:56:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:58,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:56:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:56:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:56:58,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:56:58,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406992556] [2024-10-11 13:56:58,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406992556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:56:58,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:56:58,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:56:58,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560281020] [2024-10-11 13:56:58,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:56:58,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:56:58,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:56:58,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:56:58,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:56:58,144 INFO L87 Difference]: Start difference. First operand 435 states and 640 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:56:58,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:56:58,897 INFO L93 Difference]: Finished difference Result 703 states and 1036 transitions. [2024-10-11 13:56:58,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:56:58,898 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2024-10-11 13:56:58,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:56:58,900 INFO L225 Difference]: With dead ends: 703 [2024-10-11 13:56:58,900 INFO L226 Difference]: Without dead ends: 435 [2024-10-11 13:56:58,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:56:58,904 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 237 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:56:58,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 433 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:56:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-10-11 13:56:58,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2024-10-11 13:56:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 408 states have (on average 1.4411764705882353) internal successors, (588), 408 states have internal predecessors, (588), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:56:58,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 636 transitions. [2024-10-11 13:56:58,933 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 636 transitions. Word has length 104 [2024-10-11 13:56:58,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:56:58,934 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 636 transitions. [2024-10-11 13:56:58,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:56:58,934 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 636 transitions. [2024-10-11 13:56:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 13:56:58,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:58,935 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:58,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 13:56:58,936 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:58,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:58,936 INFO L85 PathProgramCache]: Analyzing trace with hash 283012391, now seen corresponding path program 1 times [2024-10-11 13:56:58,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:58,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800641026] [2024-10-11 13:56:58,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:58,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:59,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:00,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:57:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:57:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 13:57:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:57:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:57:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:57:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,629 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:57:00,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:00,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800641026] [2024-10-11 13:57:00,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800641026] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:00,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:00,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 13:57:00,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566549333] [2024-10-11 13:57:00,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:00,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 13:57:00,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:00,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 13:57:00,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:57:00,631 INFO L87 Difference]: Start difference. First operand 435 states and 636 transitions. Second operand has 17 states, 16 states have (on average 3.0) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:57:01,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:01,996 INFO L93 Difference]: Finished difference Result 843 states and 1227 transitions. [2024-10-11 13:57:01,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:57:01,997 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2024-10-11 13:57:01,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:01,999 INFO L225 Difference]: With dead ends: 843 [2024-10-11 13:57:01,999 INFO L226 Difference]: Without dead ends: 579 [2024-10-11 13:57:02,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2024-10-11 13:57:02,001 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 263 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:02,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1046 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 13:57:02,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-10-11 13:57:02,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 525. [2024-10-11 13:57:02,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 498 states have (on average 1.4417670682730923) internal successors, (718), 498 states have internal predecessors, (718), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:57:02,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 766 transitions. [2024-10-11 13:57:02,028 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 766 transitions. Word has length 105 [2024-10-11 13:57:02,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:02,028 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 766 transitions. [2024-10-11 13:57:02,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:57:02,029 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 766 transitions. [2024-10-11 13:57:02,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 13:57:02,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:02,030 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:02,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 13:57:02,031 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:02,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:02,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1523056485, now seen corresponding path program 1 times [2024-10-11 13:57:02,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:02,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636656004] [2024-10-11 13:57:02,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:02,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:57:02,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1452745210] [2024-10-11 13:57:02,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:02,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:57:02,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:57:02,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:57:02,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 13:57:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:57:02,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:57:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:57:02,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:57:02,523 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:57:02,524 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:57:02,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 13:57:02,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 13:57:02,729 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:57:02,845 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:57:02,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:57:02 BoogieIcfgContainer [2024-10-11 13:57:02,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:57:02,848 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:57:02,848 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:57:02,848 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:57:02,849 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:56:32" (3/4) ... [2024-10-11 13:57:02,851 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:57:02,852 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:57:02,853 INFO L158 Benchmark]: Toolchain (without parser) took 32212.61ms. Allocated memory was 163.6MB in the beginning and 704.6MB in the end (delta: 541.1MB). Free memory was 107.9MB in the beginning and 557.9MB in the end (delta: -450.0MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2024-10-11 13:57:02,853 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:57:02,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.60ms. Allocated memory is still 163.6MB. Free memory was 107.4MB in the beginning and 90.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:57:02,854 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.85ms. Allocated memory is still 163.6MB. Free memory was 90.6MB in the beginning and 86.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:57:02,854 INFO L158 Benchmark]: Boogie Preprocessor took 79.63ms. Allocated memory is still 163.6MB. Free memory was 86.4MB in the beginning and 81.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 13:57:02,854 INFO L158 Benchmark]: RCFGBuilder took 883.87ms. Allocated memory was 163.6MB in the beginning and 232.8MB in the end (delta: 69.2MB). Free memory was 81.5MB in the beginning and 177.4MB in the end (delta: -95.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 13:57:02,855 INFO L158 Benchmark]: TraceAbstraction took 30828.07ms. Allocated memory was 232.8MB in the beginning and 704.6MB in the end (delta: 471.9MB). Free memory was 176.3MB in the beginning and 557.9MB in the end (delta: -381.6MB). Peak memory consumption was 91.3MB. Max. memory is 16.1GB. [2024-10-11 13:57:02,855 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 704.6MB. Free memory is still 557.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:57:02,859 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.19ms. Allocated memory is still 163.6MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.60ms. Allocated memory is still 163.6MB. Free memory was 107.4MB in the beginning and 90.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.85ms. Allocated memory is still 163.6MB. Free memory was 90.6MB in the beginning and 86.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.63ms. Allocated memory is still 163.6MB. Free memory was 86.4MB in the beginning and 81.5MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 883.87ms. Allocated memory was 163.6MB in the beginning and 232.8MB in the end (delta: 69.2MB). Free memory was 81.5MB in the beginning and 177.4MB in the end (delta: -95.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 30828.07ms. Allocated memory was 232.8MB in the beginning and 704.6MB in the end (delta: 471.9MB). Free memory was 176.3MB in the beginning and 557.9MB in the end (delta: -381.6MB). Peak memory consumption was 91.3MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 704.6MB. Free memory is still 557.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someUnaryDOUBLEoperation at line 43. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L47] unsigned short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L48] unsigned short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L49] unsigned short int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L50] unsigned short int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L51] unsigned short int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L52] unsigned short int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L53] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L54] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L55] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L56] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L57] unsigned short int last_1_WrapperStruct00_var_1_1 = 10; [L58] unsigned short int last_1_WrapperStruct00_var_1_9 = 8; [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L110] EXPR WrapperStruct00.var_1_1 [L110] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L111] EXPR WrapperStruct00.var_1_9 [L111] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L121] RET updateLastVariables() [L122] CALL updateVariables() [L89] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ushort() [L90] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L92] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L94] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L95] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ushort() [L96] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L98] WrapperStruct00.var_1_8 = __VERIFIER_nondet_ushort() [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L100] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L101] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L103] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L105] EXPR WrapperStruct00.var_1_12 [L105] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L105] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_12 [L105] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L105] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L105] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L106] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L107] EXPR WrapperStruct00.var_1_13 [L107] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L107] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_13 [L107] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L107] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L107] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L122] RET updateVariables() [L123] CALL step() [L62] COND TRUE last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1) [L63] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L63] EXPR ((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L63] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L63] EXPR ((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L63] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) [L63] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L63] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L63] (*(WrapperStruct00_var_1_1_Pointer)) = (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))) [L65] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L65] (*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L65] (*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer))) [L65] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L65] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L65] (*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L65] COND FALSE !((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) [L76] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L76] (*(WrapperStruct00_var_1_9_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L78] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L78] COND FALSE !((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) [L85] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L85] (*(WrapperStruct00_var_1_11_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR (last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1 [L114] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L114] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L114] EXPR ((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) [L114] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L114] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR (last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer))))) [L114] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L114] EXPR (*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR (*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer))) [L114] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L114] EXPR (*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))) [L114] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L114] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) && (((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) && (((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) [L114] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) [L114] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L114] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) && (((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114-L115] return (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) && (((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.6s, OverallIterations: 17, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2581 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2572 mSDsluCounter, 7246 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5449 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6993 IncrementalHoareTripleChecker+Invalid, 7168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 1797 mSDtfsCounter, 6993 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 685 GetRequests, 538 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=525occurred in iteration=16, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 391 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 1909 NumberOfCodeBlocks, 1909 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1581 ConstructedInterpolants, 0 QuantifiedInterpolants, 16562 SizeOfPredicates, 2 NumberOfNonLiveVariables, 374 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 4224/4224 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:57:02,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-2.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 c554ccc5a601f8437729d4334efbdb5f23a6f490bc0338089a1c3e75130cdbec --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:57:05,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:57:05,126 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:57:05,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:57:05,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:57:05,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:57:05,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:57:05,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:57:05,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:57:05,173 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:57:05,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:57:05,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:57:05,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:57:05,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:57:05,176 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:57:05,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:57:05,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:57:05,177 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:57:05,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:57:05,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:57:05,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:57:05,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:57:05,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:57:05,181 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:57:05,181 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:57:05,181 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:57:05,181 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:57:05,182 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:57:05,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:57:05,182 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:57:05,182 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:57:05,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:57:05,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:57:05,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:57:05,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:57:05,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:57:05,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:57:05,185 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:57:05,185 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:57:05,185 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:57:05,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:57:05,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:57:05,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:57:05,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:57:05,187 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:57:05,187 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 -> c554ccc5a601f8437729d4334efbdb5f23a6f490bc0338089a1c3e75130cdbec [2024-10-11 13:57:05,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:57:05,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:57:05,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:57:05,547 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:57:05,548 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:57:05,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i [2024-10-11 13:57:07,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:57:07,381 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:57:07,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i [2024-10-11 13:57:07,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fe440d499/84e9a6ef236348bcb05a0672b1c6d776/FLAG8a2b4d35c [2024-10-11 13:57:07,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fe440d499/84e9a6ef236348bcb05a0672b1c6d776 [2024-10-11 13:57:07,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:57:07,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:57:07,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:57:07,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:57:07,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:57:07,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:57:07" (1/1) ... [2024-10-11 13:57:07,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d4a512b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:07, skipping insertion in model container [2024-10-11 13:57:07,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:57:07" (1/1) ... [2024-10-11 13:57:07,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:57:07,979 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-2.i[916,929] [2024-10-11 13:57:08,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:57:08,078 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:57:08,092 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-2.i[916,929] [2024-10-11 13:57:08,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:57:08,172 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:57:08,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:08 WrapperNode [2024-10-11 13:57:08,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:57:08,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:57:08,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:57:08,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:57:08,181 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:57:08" (1/1) ... [2024-10-11 13:57:08,203 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:57:08" (1/1) ... [2024-10-11 13:57:08,256 INFO L138 Inliner]: procedures = 33, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 506 [2024-10-11 13:57:08,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:57:08,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:57:08,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:57:08,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:57:08,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:08" (1/1) ... [2024-10-11 13:57:08,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:08" (1/1) ... [2024-10-11 13:57:08,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:08" (1/1) ... [2024-10-11 13:57:08,311 INFO L175 MemorySlicer]: Split 131 memory accesses to 2 slices as follows [2, 129]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 15 writes are split as follows [0, 15]. [2024-10-11 13:57:08,315 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:08" (1/1) ... [2024-10-11 13:57:08,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:08" (1/1) ... [2024-10-11 13:57:08,339 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:08" (1/1) ... [2024-10-11 13:57:08,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:08" (1/1) ... [2024-10-11 13:57:08,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:08" (1/1) ... [2024-10-11 13:57:08,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:08" (1/1) ... [2024-10-11 13:57:08,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:57:08,358 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:57:08,359 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:57:08,359 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:57:08,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:08" (1/1) ... [2024-10-11 13:57:08,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:57:08,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:57:08,400 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:57:08,406 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:57:08,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:57:08,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:57:08,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:57:08,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:57:08,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:57:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:57:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:57:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:57:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:57:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:57:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:57:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:57:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:57:08,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:57:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:57:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:57:08,444 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:57:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:57:08,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:57:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:57:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:57:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:57:08,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:57:08,561 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:57:08,562 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:57:09,270 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2024-10-11 13:57:09,270 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:57:09,313 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:57:09,313 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:57:09,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:57:09 BoogieIcfgContainer [2024-10-11 13:57:09,313 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:57:09,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:57:09,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:57:09,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:57:09,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:57:07" (1/3) ... [2024-10-11 13:57:09,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423a182d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:57:09, skipping insertion in model container [2024-10-11 13:57:09,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:57:08" (2/3) ... [2024-10-11 13:57:09,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423a182d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:57:09, skipping insertion in model container [2024-10-11 13:57:09,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:57:09" (3/3) ... [2024-10-11 13:57:09,323 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-2.i [2024-10-11 13:57:09,338 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:57:09,339 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:57:09,399 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:57:09,407 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;@69b268f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:57:09,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:57:09,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:57:09,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 13:57:09,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:09,425 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:09,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:09,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1956631273, now seen corresponding path program 1 times [2024-10-11 13:57:09,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:57:09,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486279048] [2024-10-11 13:57:09,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:09,449 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:57:09,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:57:09,451 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:57:09,490 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:57:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:09,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:57:09,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:57:09,801 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-10-11 13:57:09,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:57:09,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:57:09,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486279048] [2024-10-11 13:57:09,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486279048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:09,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:09,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:57:09,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280261641] [2024-10-11 13:57:09,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:09,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:57:09,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:57:09,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:57:09,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:57:09,839 INFO L87 Difference]: Start difference. First operand has 93 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:57:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:09,892 INFO L93 Difference]: Finished difference Result 183 states and 292 transitions. [2024-10-11 13:57:09,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:57:09,895 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-11 13:57:09,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:09,903 INFO L225 Difference]: With dead ends: 183 [2024-10-11 13:57:09,903 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 13:57:09,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 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:57:09,909 INFO L432 NwaCegarLoop]: 132 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, 132 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:57:09,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:57:09,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 13:57:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 13:57:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:57:09,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 136 transitions. [2024-10-11 13:57:09,949 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 136 transitions. Word has length 95 [2024-10-11 13:57:09,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:09,950 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 136 transitions. [2024-10-11 13:57:09,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:57:09,950 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 136 transitions. [2024-10-11 13:57:09,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 13:57:09,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:09,955 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:09,962 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:57:10,155 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:57:10,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:10,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:10,157 INFO L85 PathProgramCache]: Analyzing trace with hash 283843051, now seen corresponding path program 1 times [2024-10-11 13:57:10,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:57:10,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535519027] [2024-10-11 13:57:10,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:10,158 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:57:10,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:57:10,161 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:57:10,171 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:57:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:10,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:57:10,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:57:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-11 13:57:10,441 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:57:10,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:57:10,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535519027] [2024-10-11 13:57:10,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535519027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:10,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:10,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:57:10,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484148872] [2024-10-11 13:57:10,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:10,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:57:10,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:57:10,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:57:10,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:57:10,449 INFO L87 Difference]: Start difference. First operand 91 states and 136 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:57:10,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:10,514 INFO L93 Difference]: Finished difference Result 183 states and 274 transitions. [2024-10-11 13:57:10,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:57:10,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-11 13:57:10,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:10,516 INFO L225 Difference]: With dead ends: 183 [2024-10-11 13:57:10,516 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 13:57:10,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 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:57:10,518 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 383 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:57:10,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 383 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:57:10,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 13:57:10,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 13:57:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 79 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:57:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 138 transitions. [2024-10-11 13:57:10,528 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 138 transitions. Word has length 95 [2024-10-11 13:57:10,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:10,530 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 138 transitions. [2024-10-11 13:57:10,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:57:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 138 transitions. [2024-10-11 13:57:10,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 13:57:10,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:10,532 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:10,541 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:57:10,732 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:57:10,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:10,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:10,733 INFO L85 PathProgramCache]: Analyzing trace with hash 356229609, now seen corresponding path program 1 times [2024-10-11 13:57:10,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:57:10,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767280535] [2024-10-11 13:57:10,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:10,734 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:57:10,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:57:10,738 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:57:10,739 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:57:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:10,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:57:10,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:57:11,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:57:11,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 17 [2024-10-11 13:57:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:57:11,508 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:57:11,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:57:11,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767280535] [2024-10-11 13:57:11,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767280535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:11,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:11,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:57:11,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124676743] [2024-10-11 13:57:11,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:11,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:57:11,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:57:11,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:57:11,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:57:11,512 INFO L87 Difference]: Start difference. First operand 93 states and 138 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:57:11,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:11,959 INFO L93 Difference]: Finished difference Result 278 states and 413 transitions. [2024-10-11 13:57:11,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:57:11,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2024-10-11 13:57:11,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:11,962 INFO L225 Difference]: With dead ends: 278 [2024-10-11 13:57:11,962 INFO L226 Difference]: Without dead ends: 186 [2024-10-11 13:57:11,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 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:57:11,964 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 114 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:11,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 297 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:57:11,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-11 13:57:11,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 155. [2024-10-11 13:57:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.4140625) internal successors, (181), 128 states have internal predecessors, (181), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:57:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 229 transitions. [2024-10-11 13:57:11,985 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 229 transitions. Word has length 95 [2024-10-11 13:57:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:11,986 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 229 transitions. [2024-10-11 13:57:11,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:57:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 229 transitions. [2024-10-11 13:57:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 13:57:11,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:11,987 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:11,995 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:57:12,188 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:57:12,188 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:12,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:12,189 INFO L85 PathProgramCache]: Analyzing trace with hash 442200402, now seen corresponding path program 1 times [2024-10-11 13:57:12,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:57:12,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511192119] [2024-10-11 13:57:12,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:12,190 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:57:12,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:57:12,192 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:57:12,193 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:57:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:12,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 13:57:12,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:57:12,396 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:57:12,397 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:57:12,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:57:12,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511192119] [2024-10-11 13:57:12,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511192119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:12,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:12,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:57:12,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727947349] [2024-10-11 13:57:12,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:12,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:57:12,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:57:12,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:57:12,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:57:12,403 INFO L87 Difference]: Start difference. First operand 155 states and 229 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:57:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:12,433 INFO L93 Difference]: Finished difference Result 256 states and 380 transitions. [2024-10-11 13:57:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:57:12,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2024-10-11 13:57:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:12,435 INFO L225 Difference]: With dead ends: 256 [2024-10-11 13:57:12,435 INFO L226 Difference]: Without dead ends: 157 [2024-10-11 13:57:12,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 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:57:12,437 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 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:57:12,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:57:12,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-11 13:57:12,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-10-11 13:57:12,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 130 states have (on average 1.4076923076923078) internal successors, (183), 130 states have internal predecessors, (183), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:57:12,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 231 transitions. [2024-10-11 13:57:12,466 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 231 transitions. Word has length 101 [2024-10-11 13:57:12,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:12,466 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 231 transitions. [2024-10-11 13:57:12,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:57:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 231 transitions. [2024-10-11 13:57:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 13:57:12,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:12,468 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:12,476 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 (5)] Forceful destruction successful, exit code 0 [2024-10-11 13:57:12,672 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:57:12,673 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:12,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:12,673 INFO L85 PathProgramCache]: Analyzing trace with hash -578867952, now seen corresponding path program 1 times [2024-10-11 13:57:12,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:57:12,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998647685] [2024-10-11 13:57:12,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:12,674 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:57:12,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:57:12,677 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:57:12,679 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:57:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:12,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-11 13:57:12,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:57:13,763 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:57:14,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-10-11 13:57:15,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-10-11 13:57:16,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-10-11 13:57:17,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-10-11 13:57:17,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-10-11 13:57:18,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2024-10-11 13:57:18,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-10-11 13:57:18,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2024-10-11 13:57:18,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:57:18,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 29 [2024-10-11 13:57:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 80 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-10-11 13:57:18,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 13:57:39,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:57:39,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998647685] [2024-10-11 13:57:39,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [998647685] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 13:57:39,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1866870811] [2024-10-11 13:57:39,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:39,876 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 13:57:39,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 13:57:39,879 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 13:57:39,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process