./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:57:25,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:57:25,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:57:25,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:57:25,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:57:25,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:57:25,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:57:25,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:57:25,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:57:25,922 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:57:25,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:57:25,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:57:25,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:57:25,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:57:25,924 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:57:25,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:57:25,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:57:25,925 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:57:25,925 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:57:25,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:57:25,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:57:25,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:57:25,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:57:25,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:57:25,928 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:57:25,929 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:57:25,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:57:25,929 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:57:25,930 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:57:25,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:57:25,930 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:57:25,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:57:25,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:57:25,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:57:25,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:57:25,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:57:25,933 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:57:25,933 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:57:25,934 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:57:25,934 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:57:25,934 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:57:25,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:57:25,935 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a [2024-11-12 07:57:26,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:57:26,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:57:26,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:57:26,223 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:57:26,223 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:57:26,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i [2024-11-12 07:57:27,739 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:57:27,970 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:57:27,970 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i [2024-11-12 07:57:27,982 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b0e07bb/4d71e722ac9e4e89b3143b9f18f305a6/FLAGf4f2c7445 [2024-11-12 07:57:28,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b0e07bb/4d71e722ac9e4e89b3143b9f18f305a6 [2024-11-12 07:57:28,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:57:28,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:57:28,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:57:28,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:57:28,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:57:28,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:57:28" (1/1) ... [2024-11-12 07:57:28,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@421dc554 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:28, skipping insertion in model container [2024-11-12 07:57:28,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:57:28" (1/1) ... [2024-11-12 07:57:28,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:57:28,237 WARN L250 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-9.i[916,929] [2024-11-12 07:57:28,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:57:28,328 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:57:28,341 WARN L250 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-9.i[916,929] [2024-11-12 07:57:28,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:57:28,394 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:57:28,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:28 WrapperNode [2024-11-12 07:57:28,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:57:28,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:57:28,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:57:28,400 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:57:28,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:28" (1/1) ... [2024-11-12 07:57:28,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:28" (1/1) ... [2024-11-12 07:57:28,451 INFO L138 Inliner]: procedures = 29, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 351 [2024-11-12 07:57:28,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:57:28,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:57:28,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:57:28,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:57:28,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:28" (1/1) ... [2024-11-12 07:57:28,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:28" (1/1) ... [2024-11-12 07:57:28,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:28" (1/1) ... [2024-11-12 07:57:28,497 INFO L175 MemorySlicer]: Split 86 memory accesses to 2 slices as follows [2, 84]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2024-11-12 07:57:28,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:28" (1/1) ... [2024-11-12 07:57:28,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:28" (1/1) ... [2024-11-12 07:57:28,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:28" (1/1) ... [2024-11-12 07:57:28,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:28" (1/1) ... [2024-11-12 07:57:28,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:28" (1/1) ... [2024-11-12 07:57:28,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:28" (1/1) ... [2024-11-12 07:57:28,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:57:28,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:57:28,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:57:28,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:57:28,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:28" (1/1) ... [2024-11-12 07:57:28,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:57:28,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:57:28,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:57:28,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:57:28,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:57:28,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-12 07:57:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-12 07:57:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 07:57:28,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 07:57:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-12 07:57:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-12 07:57:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 07:57:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 07:57:28,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-12 07:57:28,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-12 07:57:28,625 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:57:28,625 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:57:28,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 07:57:28,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 07:57:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:57:28,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:57:28,740 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:57:28,744 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:57:29,138 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-11-12 07:57:29,139 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:57:29,157 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:57:29,158 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:57:29,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:57:29 BoogieIcfgContainer [2024-11-12 07:57:29,158 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:57:29,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:57:29,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:57:29,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:57:29,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:57:28" (1/3) ... [2024-11-12 07:57:29,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357e0cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:57:29, skipping insertion in model container [2024-11-12 07:57:29,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:28" (2/3) ... [2024-11-12 07:57:29,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357e0cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:57:29, skipping insertion in model container [2024-11-12 07:57:29,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:57:29" (3/3) ... [2024-11-12 07:57:29,168 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-9.i [2024-11-12 07:57:29,180 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:57:29,180 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:57:29,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:57:29,238 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;@7f0cc4f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:57:29,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:57:29,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 07:57:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 07:57:29,254 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:57:29,255 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:57:29,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:57:29,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:57:29,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1156031742, now seen corresponding path program 1 times [2024-11-12 07:57:29,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:57:29,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046267871] [2024-11-12 07:57:29,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:57:29,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:57:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:29,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:57:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:29,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:57:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:29,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:57:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:29,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:57:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:29,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:57:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 07:57:29,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:57:29,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046267871] [2024-11-12 07:57:29,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046267871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:57:29,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:57:29,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:57:29,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450543476] [2024-11-12 07:57:29,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:57:29,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:57:29,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:57:29,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:57:29,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:57:29,720 INFO L87 Difference]: Start difference. First operand has 76 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 07:57:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:57:29,743 INFO L93 Difference]: Finished difference Result 145 states and 213 transitions. [2024-11-12 07:57:29,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:57:29,745 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-11-12 07:57:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:57:29,751 INFO L225 Difference]: With dead ends: 145 [2024-11-12 07:57:29,751 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 07:57:29,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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-11-12 07:57:29,757 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:57:29,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:57:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 07:57:29,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-12 07:57:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 07:57:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2024-11-12 07:57:29,791 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 62 [2024-11-12 07:57:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:57:29,791 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2024-11-12 07:57:29,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 07:57:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2024-11-12 07:57:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 07:57:29,794 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:57:29,795 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:57:29,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:57:29,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:57:29,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:57:29,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1779963588, now seen corresponding path program 1 times [2024-11-12 07:57:29,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:57:29,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278710153] [2024-11-12 07:57:29,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:57:29,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:57:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:30,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:57:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:30,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:57:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:30,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:57:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:30,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:57:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:30,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:57:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 07:57:30,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:57:30,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278710153] [2024-11-12 07:57:30,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278710153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:57:30,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:57:30,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:57:30,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286135638] [2024-11-12 07:57:30,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:57:30,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:57:30,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:57:30,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:57:30,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:57:30,060 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:30,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:57:30,110 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2024-11-12 07:57:30,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:57:30,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-12 07:57:30,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:57:30,113 INFO L225 Difference]: With dead ends: 144 [2024-11-12 07:57:30,113 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 07:57:30,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-11-12 07:57:30,115 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:57:30,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 280 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:57:30,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 07:57:30,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-11-12 07:57:30,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 07:57:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2024-11-12 07:57:30,128 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 62 [2024-11-12 07:57:30,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:57:30,131 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2024-11-12 07:57:30,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:30,131 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2024-11-12 07:57:30,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 07:57:30,133 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:57:30,133 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:57:30,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:57:30,134 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:57:30,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:57:30,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1813939130, now seen corresponding path program 1 times [2024-11-12 07:57:30,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:57:30,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228247608] [2024-11-12 07:57:30,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:57:30,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:57:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:30,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:57:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:30,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:57:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:30,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:57:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:30,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:57:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:30,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:57:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 07:57:30,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:57:30,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228247608] [2024-11-12 07:57:30,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228247608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:57:30,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:57:30,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:57:30,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957915760] [2024-11-12 07:57:30,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:57:30,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:57:30,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:57:30,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:57:30,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:57:30,842 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 07:57:31,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:57:31,232 INFO L93 Difference]: Finished difference Result 223 states and 309 transitions. [2024-11-12 07:57:31,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:57:31,233 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 62 [2024-11-12 07:57:31,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:57:31,235 INFO L225 Difference]: With dead ends: 223 [2024-11-12 07:57:31,237 INFO L226 Difference]: Without dead ends: 152 [2024-11-12 07:57:31,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:57:31,239 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 119 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:57:31,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 386 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:57:31,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-12 07:57:31,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 99. [2024-11-12 07:57:31,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 07:57:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 135 transitions. [2024-11-12 07:57:31,268 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 135 transitions. Word has length 62 [2024-11-12 07:57:31,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:57:31,268 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 135 transitions. [2024-11-12 07:57:31,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 07:57:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 135 transitions. [2024-11-12 07:57:31,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-12 07:57:31,271 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:57:31,271 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:57:31,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:57:31,271 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:57:31,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:57:31,272 INFO L85 PathProgramCache]: Analyzing trace with hash 566408353, now seen corresponding path program 1 times [2024-11-12 07:57:31,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:57:31,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271102651] [2024-11-12 07:57:31,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:57:31,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:57:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:31,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:57:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:31,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:57:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:31,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:57:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:31,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:57:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:31,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:57:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:31,371 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 07:57:31,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:57:31,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271102651] [2024-11-12 07:57:31,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271102651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:57:31,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:57:31,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:57:31,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421700154] [2024-11-12 07:57:31,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:57:31,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:57:31,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:57:31,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:57:31,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:57:31,374 INFO L87 Difference]: Start difference. First operand 99 states and 135 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:31,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:57:31,405 INFO L93 Difference]: Finished difference Result 173 states and 238 transitions. [2024-11-12 07:57:31,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:57:31,414 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), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2024-11-12 07:57:31,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:57:31,415 INFO L225 Difference]: With dead ends: 173 [2024-11-12 07:57:31,415 INFO L226 Difference]: Without dead ends: 102 [2024-11-12 07:57:31,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-11-12 07:57:31,417 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:57:31,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 281 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:57:31,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-12 07:57:31,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-11-12 07:57:31,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 07:57:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 137 transitions. [2024-11-12 07:57:31,430 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 137 transitions. Word has length 63 [2024-11-12 07:57:31,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:57:31,430 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 137 transitions. [2024-11-12 07:57:31,430 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), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 137 transitions. [2024-11-12 07:57:31,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-12 07:57:31,432 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:57:31,432 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:57:31,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:57:31,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:57:31,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:57:31,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1246466723, now seen corresponding path program 1 times [2024-11-12 07:57:31,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:57:31,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067581984] [2024-11-12 07:57:31,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:57:31,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:57:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:31,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:57:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:31,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:57:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:31,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:57:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:31,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:57:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:31,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:57:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 07:57:31,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:57:31,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067581984] [2024-11-12 07:57:31,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067581984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:57:31,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:57:31,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:57:31,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817015950] [2024-11-12 07:57:31,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:57:31,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:57:31,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:57:31,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:57:31,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:57:31,533 INFO L87 Difference]: Start difference. First operand 101 states and 137 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:57:31,555 INFO L93 Difference]: Finished difference Result 177 states and 242 transitions. [2024-11-12 07:57:31,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:57:31,556 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), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2024-11-12 07:57:31,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:57:31,557 INFO L225 Difference]: With dead ends: 177 [2024-11-12 07:57:31,557 INFO L226 Difference]: Without dead ends: 104 [2024-11-12 07:57:31,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-11-12 07:57:31,559 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:57:31,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 282 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:57:31,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-12 07:57:31,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-12 07:57:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 07:57:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 139 transitions. [2024-11-12 07:57:31,568 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 139 transitions. Word has length 63 [2024-11-12 07:57:31,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:57:31,569 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 139 transitions. [2024-11-12 07:57:31,569 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), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:31,569 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 139 transitions. [2024-11-12 07:57:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-12 07:57:31,570 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:57:31,570 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:57:31,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:57:31,571 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:57:31,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:57:31,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1248313765, now seen corresponding path program 1 times [2024-11-12 07:57:31,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:57:31,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924815488] [2024-11-12 07:57:31,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:57:31,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:57:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:31,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:57:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:31,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:57:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:31,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:57:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:31,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:57:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:31,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:57:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 07:57:32,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:57:32,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924815488] [2024-11-12 07:57:32,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924815488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:57:32,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:57:32,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:57:32,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821610838] [2024-11-12 07:57:32,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:57:32,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:57:32,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:57:32,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:57:32,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:57:32,006 INFO L87 Difference]: Start difference. First operand 103 states and 139 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:32,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:57:32,151 INFO L93 Difference]: Finished difference Result 180 states and 245 transitions. [2024-11-12 07:57:32,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:57:32,152 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2024-11-12 07:57:32,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:57:32,153 INFO L225 Difference]: With dead ends: 180 [2024-11-12 07:57:32,153 INFO L226 Difference]: Without dead ends: 105 [2024-11-12 07:57:32,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:57:32,154 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 124 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:57:32,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 250 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:57:32,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-12 07:57:32,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-12 07:57:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.315217391304348) internal successors, (121), 92 states have internal predecessors, (121), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 07:57:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 141 transitions. [2024-11-12 07:57:32,165 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 141 transitions. Word has length 63 [2024-11-12 07:57:32,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:57:32,165 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 141 transitions. [2024-11-12 07:57:32,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:32,166 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 141 transitions. [2024-11-12 07:57:32,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 07:57:32,170 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:57:32,171 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:57:32,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:57:32,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:57:32,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:57:32,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2085121383, now seen corresponding path program 1 times [2024-11-12 07:57:32,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:57:32,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054629575] [2024-11-12 07:57:32,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:57:32,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:57:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:32,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:57:32,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:33,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:57:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:33,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:57:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:33,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:57:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:33,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:57:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 07:57:33,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:57:33,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054629575] [2024-11-12 07:57:33,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054629575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:57:33,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:57:33,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 07:57:33,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044273314] [2024-11-12 07:57:33,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:57:33,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 07:57:33,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:57:33,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 07:57:33,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:57:33,049 INFO L87 Difference]: Start difference. First operand 105 states and 141 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 07:57:33,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:57:33,378 INFO L93 Difference]: Finished difference Result 233 states and 315 transitions. [2024-11-12 07:57:33,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:57:33,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2024-11-12 07:57:33,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:57:33,380 INFO L225 Difference]: With dead ends: 233 [2024-11-12 07:57:33,380 INFO L226 Difference]: Without dead ends: 156 [2024-11-12 07:57:33,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-12 07:57:33,383 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 432 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:57:33,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 172 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:57:33,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-12 07:57:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 126. [2024-11-12 07:57:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 113 states have (on average 1.345132743362832) internal successors, (152), 113 states have internal predecessors, (152), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 07:57:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 172 transitions. [2024-11-12 07:57:33,413 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 172 transitions. Word has length 67 [2024-11-12 07:57:33,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:57:33,414 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 172 transitions. [2024-11-12 07:57:33,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-12 07:57:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 172 transitions. [2024-11-12 07:57:33,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 07:57:33,415 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:57:33,416 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:57:33,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:57:33,416 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:57:33,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:57:33,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1013672813, now seen corresponding path program 1 times [2024-11-12 07:57:33,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:57:33,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120852597] [2024-11-12 07:57:33,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:57:33,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:57:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:33,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:57:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:33,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:57:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:33,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:57:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:33,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:57:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:33,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:57:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:33,653 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 07:57:33,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:57:33,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120852597] [2024-11-12 07:57:33,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120852597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:57:33,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:57:33,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 07:57:33,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310522422] [2024-11-12 07:57:33,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:57:33,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:57:33,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:57:33,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:57:33,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:57:33,656 INFO L87 Difference]: Start difference. First operand 126 states and 172 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:57:33,833 INFO L93 Difference]: Finished difference Result 262 states and 356 transitions. [2024-11-12 07:57:33,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:57:33,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2024-11-12 07:57:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:57:33,835 INFO L225 Difference]: With dead ends: 262 [2024-11-12 07:57:33,836 INFO L226 Difference]: Without dead ends: 164 [2024-11-12 07:57:33,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:57:33,837 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 147 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:57:33,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 254 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:57:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-12 07:57:33,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 130. [2024-11-12 07:57:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 117 states have (on average 1.3333333333333333) internal successors, (156), 117 states have internal predecessors, (156), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 07:57:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2024-11-12 07:57:33,861 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 67 [2024-11-12 07:57:33,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:57:33,862 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2024-11-12 07:57:33,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2024-11-12 07:57:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-12 07:57:33,863 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:57:33,864 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:57:33,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:57:33,864 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:57:33,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:57:33,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1047048597, now seen corresponding path program 1 times [2024-11-12 07:57:33,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:57:33,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670905332] [2024-11-12 07:57:33,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:57:33,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:57:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 07:57:33,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [86556626] [2024-11-12 07:57:33,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:57:33,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:57:33,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:57:33,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:57:33,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 07:57:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:57:34,220 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:57:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:57:34,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:57:34,410 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:57:34,411 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:57:34,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 07:57:34,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:57:34,623 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:57:34,729 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:57:34,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:57:34 BoogieIcfgContainer [2024-11-12 07:57:34,734 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:57:34,734 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:57:34,734 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:57:34,734 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:57:34,735 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:57:29" (3/4) ... [2024-11-12 07:57:34,737 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:57:34,738 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:57:34,739 INFO L158 Benchmark]: Toolchain (without parser) took 6732.42ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 111.7MB in the beginning and 131.5MB in the end (delta: -19.8MB). Peak memory consumption was 50.7MB. Max. memory is 16.1GB. [2024-11-12 07:57:34,739 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:57:34,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.25ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 95.5MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 07:57:34,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.04ms. Allocated memory is still 167.8MB. Free memory was 95.5MB in the beginning and 92.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 07:57:34,740 INFO L158 Benchmark]: Boogie Preprocessor took 70.84ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 88.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:57:34,740 INFO L158 Benchmark]: RCFGBuilder took 631.68ms. Allocated memory is still 167.8MB. Free memory was 88.7MB in the beginning and 60.8MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-12 07:57:34,741 INFO L158 Benchmark]: TraceAbstraction took 5573.15ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 59.9MB in the beginning and 131.5MB in the end (delta: -71.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:57:34,741 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 237.0MB. Free memory is still 131.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:57:34,742 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.20ms. Allocated memory is still 167.8MB. Free memory is still 130.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.25ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 95.5MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.04ms. Allocated memory is still 167.8MB. Free memory was 95.5MB in the beginning and 92.3MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.84ms. Allocated memory is still 167.8MB. Free memory was 92.3MB in the beginning and 88.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 631.68ms. Allocated memory is still 167.8MB. Free memory was 88.7MB in the beginning and 60.8MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5573.15ms. Allocated memory was 167.8MB in the beginning and 237.0MB in the end (delta: 69.2MB). Free memory was 59.9MB in the beginning and 131.5MB in the end (delta: -71.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 237.0MB. Free memory is still 131.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of shiftLeft at line 104. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L45] unsigned char* WrapperStruct0_var_1_1_Pointer = &(WrapperStruct0.var_1_1); [L46] unsigned char* WrapperStruct0_var_1_3_Pointer = &(WrapperStruct0.var_1_3); [L47] unsigned char* WrapperStruct0_var_1_7_Pointer = &(WrapperStruct0.var_1_7); [L48] signed short int* WrapperStruct0_var_1_8_Pointer = &(WrapperStruct0.var_1_8); [L49] unsigned char* WrapperStruct0_var_1_9_Pointer = &(WrapperStruct0.var_1_9); [L50] double* WrapperStruct0_var_1_10_Pointer = &(WrapperStruct0.var_1_10); [L51] double* WrapperStruct0_var_1_11_Pointer = &(WrapperStruct0.var_1_11); [L52] signed short int* WrapperStruct0_var_1_12_Pointer = &(WrapperStruct0.var_1_12); [L53] signed long int* WrapperStruct0_var_1_14_Pointer = &(WrapperStruct0.var_1_14); [L54] unsigned char last_1_WrapperStruct0_var_1_1 = 10; [L55] double last_1_WrapperStruct0_var_1_10 = 9.2; [L56] signed short int last_1_WrapperStruct0_var_1_12 = 1; [L57] signed long int last_1_WrapperStruct0_var_1_14 = -16; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=0, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L98] EXPR WrapperStruct0.var_1_1 [L98] last_1_WrapperStruct0_var_1_1 = WrapperStruct0.var_1_1 [L99] EXPR WrapperStruct0.var_1_10 [L99] last_1_WrapperStruct0_var_1_10 = WrapperStruct0.var_1_10 [L100] EXPR WrapperStruct0.var_1_12 [L100] last_1_WrapperStruct0_var_1_12 = WrapperStruct0.var_1_12 [L101] EXPR WrapperStruct0.var_1_14 [L101] last_1_WrapperStruct0_var_1_14 = WrapperStruct0.var_1_14 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L88] WrapperStruct0.var_1_3 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct0.var_1_3 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L89] CALL assume_abort_if_not(WrapperStruct0.var_1_3 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L89] RET assume_abort_if_not(WrapperStruct0.var_1_3 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L90] EXPR WrapperStruct0.var_1_3 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L90] CALL assume_abort_if_not(WrapperStruct0.var_1_3 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L90] RET assume_abort_if_not(WrapperStruct0.var_1_3 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L91] WrapperStruct0.var_1_7 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct0.var_1_7 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L92] CALL assume_abort_if_not(WrapperStruct0.var_1_7 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L92] RET assume_abort_if_not(WrapperStruct0.var_1_7 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L93] EXPR WrapperStruct0.var_1_7 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L93] CALL assume_abort_if_not(WrapperStruct0.var_1_7 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L93] RET assume_abort_if_not(WrapperStruct0.var_1_7 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L94] WrapperStruct0.var_1_11 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct0.var_1_11 [L95] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F [L95] EXPR WrapperStruct0.var_1_11 [L95] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] CALL assume_abort_if_not((WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] RET assume_abort_if_not((WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L112] RET updateVariables() [L113] CALL step() [L61] unsigned char stepLocal_0 = last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10, stepLocal_0=0] [L62] COND FALSE !(((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || stepLocal_0) [L65] (*(WrapperStruct0_var_1_12_Pointer)) = last_1_WrapperStruct0_var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L67] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L67] (*(WrapperStruct0_var_1_14_Pointer)) = (*(WrapperStruct0_var_1_12_Pointer)) [L68] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L68] EXPR 10 << (*(WrapperStruct0_var_1_12_Pointer)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L68] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L68] EXPR \read(*WrapperStruct0_var_1_14_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L68] COND TRUE (10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer))) [L69] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_14_Pointer) [L69] (*(WrapperStruct0_var_1_8_Pointer)) = ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))) [L71] (*(WrapperStruct0_var_1_9_Pointer)) = 64 [L72] EXPR \read(*WrapperStruct0_var_1_11_Pointer) [L72] (*(WrapperStruct0_var_1_10_Pointer)) = (*(WrapperStruct0_var_1_11_Pointer)) [L73] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L73] COND TRUE (*(WrapperStruct0_var_1_12_Pointer)) <= 16 [L74] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L74] (*(WrapperStruct0_var_1_1_Pointer)) = (*(WrapperStruct0_var_1_3_Pointer)) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) [L104] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L104] EXPR ((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1) [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR 10 << (*(WrapperStruct0_var_1_12_Pointer)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_14_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1 [L104] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_14_Pointer) [L104] EXPR ((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64)) [L104] EXPR \read(*WrapperStruct0_var_1_9_Pointer) [L104] EXPR ((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer)))) [L104] EXPR \read(*WrapperStruct0_var_1_10_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_11_Pointer) [L104] EXPR (((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && ((*(WrapperStruct0_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_12_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && ((*(WrapperStruct0_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_12_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104-L105] return (((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && ((*(WrapperStruct0_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_12_Pointer)))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L19] reach_error() VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 825 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 825 mSDsluCounter, 2005 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1335 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 726 IncrementalHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 670 mSDtfsCounter, 726 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=8, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 120 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 645 NumberOfCodeBlocks, 645 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 501 ConstructedInterpolants, 0 QuantifiedInterpolants, 2134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 320/320 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-11-12 07:57:34,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:57:37,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:57:37,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:57:37,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:57:37,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:57:37,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:57:37,153 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:57:37,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:57:37,154 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:57:37,154 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:57:37,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:57:37,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:57:37,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:57:37,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:57:37,158 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:57:37,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:57:37,159 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:57:37,159 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:57:37,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:57:37,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:57:37,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:57:37,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:57:37,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:57:37,164 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:57:37,164 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:57:37,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:57:37,165 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:57:37,166 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:57:37,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:57:37,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:57:37,167 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:57:37,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:57:37,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:57:37,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:57:37,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:57:37,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:57:37,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:57:37,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:57:37,170 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:57:37,170 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:57:37,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:57:37,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:57:37,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:57:37,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:57:37,171 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a [2024-11-12 07:57:37,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:57:37,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:57:37,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:57:37,529 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:57:37,530 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:57:37,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i [2024-11-12 07:57:39,249 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:57:39,480 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:57:39,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i [2024-11-12 07:57:39,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf2f064a/90b76e43bf0d4aabb10e38c066d7b811/FLAG49f5a147d [2024-11-12 07:57:39,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bf2f064a/90b76e43bf0d4aabb10e38c066d7b811 [2024-11-12 07:57:39,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:57:39,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:57:39,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:57:39,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:57:39,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:57:39,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:57:39" (1/1) ... [2024-11-12 07:57:39,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a858824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:39, skipping insertion in model container [2024-11-12 07:57:39,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:57:39" (1/1) ... [2024-11-12 07:57:39,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:57:40,062 WARN L250 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-9.i[916,929] [2024-11-12 07:57:40,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:57:40,158 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:57:40,169 WARN L250 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-9.i[916,929] [2024-11-12 07:57:40,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:57:40,244 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:57:40,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:40 WrapperNode [2024-11-12 07:57:40,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:57:40,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:57:40,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:57:40,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:57:40,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:40" (1/1) ... [2024-11-12 07:57:40,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:40" (1/1) ... [2024-11-12 07:57:40,315 INFO L138 Inliner]: procedures = 36, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 337 [2024-11-12 07:57:40,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:57:40,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:57:40,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:57:40,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:57:40,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:40" (1/1) ... [2024-11-12 07:57:40,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:40" (1/1) ... [2024-11-12 07:57:40,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:40" (1/1) ... [2024-11-12 07:57:40,370 INFO L175 MemorySlicer]: Split 86 memory accesses to 2 slices as follows [2, 84]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2024-11-12 07:57:40,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:40" (1/1) ... [2024-11-12 07:57:40,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:40" (1/1) ... [2024-11-12 07:57:40,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:40" (1/1) ... [2024-11-12 07:57:40,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:40" (1/1) ... [2024-11-12 07:57:40,406 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:40" (1/1) ... [2024-11-12 07:57:40,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:40" (1/1) ... [2024-11-12 07:57:40,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:57:40,417 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:57:40,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:57:40,418 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:57:40,419 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:40" (1/1) ... [2024-11-12 07:57:40,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:57:40,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:57:40,459 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:57:40,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:57:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:57:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-12 07:57:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-12 07:57:40,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-12 07:57:40,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-12 07:57:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:57:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:57:40,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-12 07:57:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-12 07:57:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:57:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:57:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-12 07:57:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-12 07:57:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-12 07:57:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-12 07:57:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 07:57:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 07:57:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-12 07:57:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-12 07:57:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:57:40,518 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:57:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:57:40,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:57:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:57:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:57:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-12 07:57:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-12 07:57:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 07:57:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 07:57:40,678 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:57:40,680 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:57:41,232 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-11-12 07:57:41,232 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:57:41,248 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:57:41,248 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:57:41,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:57:41 BoogieIcfgContainer [2024-11-12 07:57:41,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:57:41,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:57:41,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:57:41,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:57:41,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:57:39" (1/3) ... [2024-11-12 07:57:41,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7182eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:57:41, skipping insertion in model container [2024-11-12 07:57:41,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:57:40" (2/3) ... [2024-11-12 07:57:41,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7182eca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:57:41, skipping insertion in model container [2024-11-12 07:57:41,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:57:41" (3/3) ... [2024-11-12 07:57:41,259 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-9.i [2024-11-12 07:57:41,285 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:57:41,285 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:57:41,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:57:41,369 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;@479646ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:57:41,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:57:41,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 07:57:41,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 07:57:41,382 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:57:41,383 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:57:41,384 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:57:41,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:57:41,390 INFO L85 PathProgramCache]: Analyzing trace with hash -562539789, now seen corresponding path program 1 times [2024-11-12 07:57:41,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:57:41,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538307181] [2024-11-12 07:57:41,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:57:41,406 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-11-12 07:57:41,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:57:41,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:57:41,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 07:57:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:41,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:57:41,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:57:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-12 07:57:41,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:57:41,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:57:41,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538307181] [2024-11-12 07:57:41,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538307181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:57:41,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:57:41,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:57:41,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170054323] [2024-11-12 07:57:41,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:57:41,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:57:41,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:57:41,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:57:41,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:57:41,784 INFO L87 Difference]: Start difference. First operand has 70 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:41,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:57:41,822 INFO L93 Difference]: Finished difference Result 133 states and 197 transitions. [2024-11-12 07:57:41,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:57:41,826 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-12 07:57:41,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:57:41,833 INFO L225 Difference]: With dead ends: 133 [2024-11-12 07:57:41,834 INFO L226 Difference]: Without dead ends: 66 [2024-11-12 07:57:41,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-11-12 07:57:41,841 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:57:41,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:57:41,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-12 07:57:41,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-12 07:57:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 07:57:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2024-11-12 07:57:41,883 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 60 [2024-11-12 07:57:41,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:57:41,884 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2024-11-12 07:57:41,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:41,885 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2024-11-12 07:57:41,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 07:57:41,887 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:57:41,888 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:57:41,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 07:57:42,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:57:42,093 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:57:42,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:57:42,094 INFO L85 PathProgramCache]: Analyzing trace with hash -830046663, now seen corresponding path program 1 times [2024-11-12 07:57:42,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:57:42,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094106254] [2024-11-12 07:57:42,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:57:42,095 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-11-12 07:57:42,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:57:42,099 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:57:42,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 07:57:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:42,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:57:42,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:57:42,348 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 07:57:42,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:57:42,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:57:42,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094106254] [2024-11-12 07:57:42,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094106254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:57:42,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:57:42,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:57:42,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335755791] [2024-11-12 07:57:42,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:57:42,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:57:42,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:57:42,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:57:42,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:57:42,357 INFO L87 Difference]: Start difference. First operand 66 states and 92 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:42,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:57:42,404 INFO L93 Difference]: Finished difference Result 132 states and 185 transitions. [2024-11-12 07:57:42,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:57:42,405 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-12 07:57:42,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:57:42,407 INFO L225 Difference]: With dead ends: 132 [2024-11-12 07:57:42,407 INFO L226 Difference]: Without dead ends: 69 [2024-11-12 07:57:42,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 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-11-12 07:57:42,408 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:57:42,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 256 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:57:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-12 07:57:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-11-12 07:57:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 07:57:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2024-11-12 07:57:42,425 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 60 [2024-11-12 07:57:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:57:42,426 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2024-11-12 07:57:42,428 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2024-11-12 07:57:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 07:57:42,431 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:57:42,432 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:57:42,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 07:57:42,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:57:42,633 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:57:42,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:57:42,634 INFO L85 PathProgramCache]: Analyzing trace with hash -128982085, now seen corresponding path program 1 times [2024-11-12 07:57:42,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:57:42,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222431825] [2024-11-12 07:57:42,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:57:42,635 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-11-12 07:57:42,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:57:42,638 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:57:42,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 07:57:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:42,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:57:42,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:57:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 07:57:42,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:57:42,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:57:42,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222431825] [2024-11-12 07:57:42,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222431825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:57:42,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:57:42,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:57:42,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147822241] [2024-11-12 07:57:42,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:57:42,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:57:42,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:57:42,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:57:42,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:57:42,919 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:42,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:57:42,985 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2024-11-12 07:57:42,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:57:42,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-12 07:57:42,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:57:42,989 INFO L225 Difference]: With dead ends: 136 [2024-11-12 07:57:42,989 INFO L226 Difference]: Without dead ends: 71 [2024-11-12 07:57:42,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:57:42,992 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:57:42,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 333 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:57:42,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-12 07:57:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-11-12 07:57:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 07:57:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2024-11-12 07:57:43,001 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 60 [2024-11-12 07:57:43,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:57:43,001 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2024-11-12 07:57:43,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2024-11-12 07:57:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 07:57:43,003 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:57:43,003 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:57:43,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 07:57:43,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:57:43,205 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:57:43,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:57:43,205 INFO L85 PathProgramCache]: Analyzing trace with hash 551076285, now seen corresponding path program 1 times [2024-11-12 07:57:43,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:57:43,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32973795] [2024-11-12 07:57:43,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:57:43,206 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-11-12 07:57:43,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:57:43,207 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:57:43,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 07:57:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:43,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 07:57:43,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:57:43,467 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 07:57:43,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:57:43,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:57:43,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32973795] [2024-11-12 07:57:43,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32973795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:57:43,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:57:43,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 07:57:43,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372580600] [2024-11-12 07:57:43,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:57:43,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 07:57:43,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:57:43,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 07:57:43,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:57:43,472 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:43,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:57:43,565 INFO L93 Difference]: Finished difference Result 142 states and 196 transitions. [2024-11-12 07:57:43,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:57:43,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-12 07:57:43,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:57:43,568 INFO L225 Difference]: With dead ends: 142 [2024-11-12 07:57:43,568 INFO L226 Difference]: Without dead ends: 75 [2024-11-12 07:57:43,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 07:57:43,570 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:57:43,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:57:43,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-12 07:57:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-11-12 07:57:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 67 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 07:57:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2024-11-12 07:57:43,583 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 60 [2024-11-12 07:57:43,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:57:43,584 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2024-11-12 07:57:43,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2024-11-12 07:57:43,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 07:57:43,585 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:57:43,586 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:57:43,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 07:57:43,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:57:43,790 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:57:43,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:57:43,791 INFO L85 PathProgramCache]: Analyzing trace with hash 552923327, now seen corresponding path program 1 times [2024-11-12 07:57:43,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:57:43,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775726148] [2024-11-12 07:57:43,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:57:43,792 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-11-12 07:57:43,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:57:43,795 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:57:43,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 07:57:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:44,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-12 07:57:44,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:57:44,701 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-11-12 07:57:45,999 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 21 treesize of output 20 [2024-11-12 07:57:47,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2024-11-12 07:57:50,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2024-11-12 07:57:50,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2024-11-12 07:57:51,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2024-11-12 07:57:51,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 72 [2024-11-12 07:57:51,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 87 [2024-11-12 07:57:51,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:57:51,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 110 treesize of output 58 [2024-11-12 07:57:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 07:57:51,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:57:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-12 07:57:51,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:57:51,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775726148] [2024-11-12 07:57:51,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775726148] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 07:57:51,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 07:57:51,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-12 07:57:51,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652519595] [2024-11-12 07:57:51,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:57:51,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:57:51,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:57:51,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:57:51,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=173, Unknown=1, NotChecked=0, Total=210 [2024-11-12 07:57:51,739 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:52,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:57:52,040 INFO L93 Difference]: Finished difference Result 149 states and 202 transitions. [2024-11-12 07:57:52,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:57:52,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-12 07:57:52,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:57:52,042 INFO L225 Difference]: With dead ends: 149 [2024-11-12 07:57:52,043 INFO L226 Difference]: Without dead ends: 78 [2024-11-12 07:57:52,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=44, Invalid=227, Unknown=1, NotChecked=0, Total=272 [2024-11-12 07:57:52,044 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 44 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 07:57:52,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 235 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 07:57:52,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-12 07:57:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2024-11-12 07:57:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 69 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 07:57:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2024-11-12 07:57:52,051 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 60 [2024-11-12 07:57:52,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:57:52,055 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2024-11-12 07:57:52,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-12 07:57:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2024-11-12 07:57:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 07:57:52,057 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:57:52,057 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 07:57:52,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-12 07:57:52,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:57:52,262 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:57:52,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:57:52,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1489190506, now seen corresponding path program 1 times [2024-11-12 07:57:52,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:57:52,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434982686] [2024-11-12 07:57:52,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:57:52,263 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-11-12 07:57:52,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:57:52,265 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:57:52,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 07:57:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:57:52,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-12 07:57:52,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:57:54,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-11-12 07:57:55,616 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 109 treesize of output 67 [2024-11-12 07:57:55,798 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 102 treesize of output 76 [2024-11-12 07:57:55,980 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 102 treesize of output 76 [2024-11-12 07:57:56,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 121 [2024-11-12 07:57:56,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 130 [2024-11-12 07:57:56,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:57:56,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 304 treesize of output 152 [2024-11-12 07:57:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 07:57:56,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:58:30,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:58:30,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434982686] [2024-11-12 07:58:30,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434982686] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:58:30,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [801017786] [2024-11-12 07:58:30,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:58:30,096 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 07:58:30,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 07:58:30,098 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 07:58:30,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-12 07:58:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:58:31,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-12 07:58:31,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:58:33,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-12 07:58:36,563 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 117 treesize of output 71 [2024-11-12 07:58:36,922 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 110 treesize of output 80 [2024-11-12 07:58:37,192 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 110 treesize of output 80 [2024-11-12 07:58:37,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 125 [2024-11-12 07:58:37,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 91 [2024-11-12 07:58:39,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 86 [2024-11-12 07:58:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 07:58:39,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:58:56,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [801017786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:58:56,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:58:56,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2024-11-12 07:58:56,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313921282] [2024-11-12 07:58:56,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:58:56,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 07:58:56,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:58:56,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 07:58:56,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=737, Unknown=6, NotChecked=0, Total=870 [2024-11-12 07:58:56,970 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 24 states, 24 states have (on average 3.25) internal successors, (78), 23 states have internal predecessors, (78), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10)