./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.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 a4adac79d6cea52ff1f2363c41bfef3a91ebf33bfb8642b8f2d3700c04ed5429 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:08:24,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:08:24,959 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 14:08:24,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:08:24,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:08:24,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:08:24,993 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:08:24,993 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:08:24,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:08:24,994 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:08:24,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:08:24,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:08:24,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:08:24,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:08:24,997 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:08:24,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:08:24,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:08:24,998 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:08:24,998 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 14:08:24,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:08:24,999 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:08:24,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:08:25,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:08:25,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:08:25,001 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:08:25,001 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:08:25,001 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:08:25,002 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:08:25,002 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:08:25,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:08:25,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:08:25,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:08:25,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:08:25,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:08:25,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:08:25,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:08:25,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 14:08:25,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 14:08:25,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:08:25,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:08:25,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:08:25,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:08:25,007 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 -> a4adac79d6cea52ff1f2363c41bfef3a91ebf33bfb8642b8f2d3700c04ed5429 [2024-10-14 14:08:25,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:08:25,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:08:25,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:08:25,359 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:08:25,360 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:08:25,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i [2024-10-14 14:08:26,870 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:08:27,141 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:08:27,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i [2024-10-14 14:08:27,154 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed111527/a880095b6969438c944fb279e135b0db/FLAG240d8a096 [2024-10-14 14:08:27,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ed111527/a880095b6969438c944fb279e135b0db [2024-10-14 14:08:27,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:08:27,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:08:27,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:08:27,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:08:27,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:08:27,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:08:27" (1/1) ... [2024-10-14 14:08:27,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b45d19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:27, skipping insertion in model container [2024-10-14 14:08:27,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:08:27" (1/1) ... [2024-10-14 14:08:27,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:08:27,376 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i[917,930] [2024-10-14 14:08:27,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:08:27,483 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:08:27,497 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i[917,930] [2024-10-14 14:08:27,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:08:27,568 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:08:27,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:27 WrapperNode [2024-10-14 14:08:27,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:08:27,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:08:27,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:08:27,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:08:27,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:27" (1/1) ... [2024-10-14 14:08:27,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:27" (1/1) ... [2024-10-14 14:08:27,636 INFO L138 Inliner]: procedures = 29, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 474 [2024-10-14 14:08:27,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:08:27,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:08:27,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:08:27,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:08:27,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:27" (1/1) ... [2024-10-14 14:08:27,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:27" (1/1) ... [2024-10-14 14:08:27,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:27" (1/1) ... [2024-10-14 14:08:27,679 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2024-10-14 14:08:27,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:27" (1/1) ... [2024-10-14 14:08:27,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:27" (1/1) ... [2024-10-14 14:08:27,697 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:27" (1/1) ... [2024-10-14 14:08:27,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:27" (1/1) ... [2024-10-14 14:08:27,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:27" (1/1) ... [2024-10-14 14:08:27,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:27" (1/1) ... [2024-10-14 14:08:27,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:08:27,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:08:27,713 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:08:27,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:08:27,714 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:27" (1/1) ... [2024-10-14 14:08:27,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:08:27,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:08:27,754 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 14:08:27,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 14:08:27,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:08:27,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 14:08:27,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 14:08:27,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 14:08:27,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 14:08:27,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 14:08:27,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 14:08:27,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 14:08:27,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 14:08:27,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 14:08:27,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 14:08:27,816 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 14:08:27,816 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 14:08:27,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 14:08:27,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 14:08:27,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:08:27,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:08:27,967 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:08:27,970 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:08:28,475 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-10-14 14:08:28,476 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:08:28,514 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:08:28,515 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 14:08:28,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:08:28 BoogieIcfgContainer [2024-10-14 14:08:28,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:08:28,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:08:28,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:08:28,523 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:08:28,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:08:27" (1/3) ... [2024-10-14 14:08:28,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d57365e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:08:28, skipping insertion in model container [2024-10-14 14:08:28,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:27" (2/3) ... [2024-10-14 14:08:28,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d57365e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:08:28, skipping insertion in model container [2024-10-14 14:08:28,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:08:28" (3/3) ... [2024-10-14 14:08:28,527 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-54.i [2024-10-14 14:08:28,546 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:08:28,546 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 14:08:28,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:08:28,624 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;@34c61182, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:08:28,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 14:08:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:08:28,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 14:08:28,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:28,644 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:28,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:28,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:28,653 INFO L85 PathProgramCache]: Analyzing trace with hash 49234744, now seen corresponding path program 1 times [2024-10-14 14:08:28,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:08:28,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039945123] [2024-10-14 14:08:28,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:28,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:08:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:28,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:08:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:28,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:08:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:28,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:08:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:08:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:08:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:08:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:08:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:08:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:08:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:08:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:08:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:08:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:08:29,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:08:29,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039945123] [2024-10-14 14:08:29,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039945123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:08:29,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:08:29,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:08:29,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98872174] [2024-10-14 14:08:29,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:08:29,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 14:08:29,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:08:29,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 14:08:29,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:08:29,123 INFO L87 Difference]: Start difference. First operand has 103 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 14:08:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:08:29,178 INFO L93 Difference]: Finished difference Result 203 states and 320 transitions. [2024-10-14 14:08:29,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 14:08:29,182 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-10-14 14:08:29,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:08:29,192 INFO L225 Difference]: With dead ends: 203 [2024-10-14 14:08:29,194 INFO L226 Difference]: Without dead ends: 101 [2024-10-14 14:08:29,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:08:29,202 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:08:29,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:08:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-14 14:08:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-14 14:08:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 87 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:08:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2024-10-14 14:08:29,252 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 100 [2024-10-14 14:08:29,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:08:29,253 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2024-10-14 14:08:29,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 14:08:29,257 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2024-10-14 14:08:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 14:08:29,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:29,264 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:29,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 14:08:29,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:29,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:29,265 INFO L85 PathProgramCache]: Analyzing trace with hash 639984100, now seen corresponding path program 1 times [2024-10-14 14:08:29,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:08:29,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938841049] [2024-10-14 14:08:29,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:29,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:08:29,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:08:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:08:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:08:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:08:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:08:29,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:08:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:08:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:08:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:08:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:08:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:08:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:08:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:08:29,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:08:29,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938841049] [2024-10-14 14:08:29,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938841049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:08:29,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:08:29,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:08:29,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330174771] [2024-10-14 14:08:29,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:08:29,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:08:29,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:08:29,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:08:29,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:08:29,769 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:08:29,832 INFO L93 Difference]: Finished difference Result 203 states and 302 transitions. [2024-10-14 14:08:29,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:08:29,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-10-14 14:08:29,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:08:29,835 INFO L225 Difference]: With dead ends: 203 [2024-10-14 14:08:29,835 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 14:08:29,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:08:29,837 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:08:29,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:08:29,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 14:08:29,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-14 14:08:29,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:08:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2024-10-14 14:08:29,847 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 100 [2024-10-14 14:08:29,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:08:29,849 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-10-14 14:08:29,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:29,849 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2024-10-14 14:08:29,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 14:08:29,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:29,851 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:29,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 14:08:29,852 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:29,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:29,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1387866121, now seen corresponding path program 1 times [2024-10-14 14:08:29,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:08:29,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171771851] [2024-10-14 14:08:29,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:29,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:08:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:08:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:08:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:08:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:08:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:08:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:08:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:08:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:08:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:08:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:08:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:08:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:08:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:08:30,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:08:30,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171771851] [2024-10-14 14:08:30,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171771851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:08:30,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:08:30,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:08:30,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667149736] [2024-10-14 14:08:30,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:08:30,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:08:30,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:08:30,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:08:30,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:08:30,084 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:30,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:08:30,142 INFO L93 Difference]: Finished difference Result 208 states and 307 transitions. [2024-10-14 14:08:30,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:08:30,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-14 14:08:30,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:08:30,150 INFO L225 Difference]: With dead ends: 208 [2024-10-14 14:08:30,151 INFO L226 Difference]: Without dead ends: 106 [2024-10-14 14:08:30,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:08:30,153 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:08:30,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 422 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:08:30,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-14 14:08:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-10-14 14:08:30,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 91 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:08:30,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2024-10-14 14:08:30,165 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 102 [2024-10-14 14:08:30,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:08:30,166 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2024-10-14 14:08:30,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2024-10-14 14:08:30,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 14:08:30,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:30,168 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:30,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 14:08:30,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:30,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:30,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1445124423, now seen corresponding path program 1 times [2024-10-14 14:08:30,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:08:30,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623187862] [2024-10-14 14:08:30,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:30,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:08:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:08:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:08:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:08:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:08:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:08:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:08:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:08:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:08:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:08:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:08:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:08:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:08:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:08:30,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:08:30,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623187862] [2024-10-14 14:08:30,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623187862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:08:30,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:08:30,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:08:30,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958247904] [2024-10-14 14:08:30,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:08:30,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:08:30,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:08:30,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:08:30,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:08:30,376 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:30,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:08:30,425 INFO L93 Difference]: Finished difference Result 212 states and 311 transitions. [2024-10-14 14:08:30,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:08:30,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-14 14:08:30,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:08:30,429 INFO L225 Difference]: With dead ends: 212 [2024-10-14 14:08:30,429 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 14:08:30,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:08:30,431 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:08:30,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 426 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:08:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 14:08:30,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-14 14:08:30,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 93 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:08:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2024-10-14 14:08:30,442 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 102 [2024-10-14 14:08:30,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:08:30,442 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2024-10-14 14:08:30,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:30,443 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2024-10-14 14:08:30,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 14:08:30,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:30,448 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:30,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 14:08:30,448 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:30,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:30,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1445184005, now seen corresponding path program 1 times [2024-10-14 14:08:30,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:08:30,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469262918] [2024-10-14 14:08:30,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:30,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:08:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:08:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:08:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:08:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:08:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:08:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:08:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:08:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:08:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:08:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:08:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:30,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:08:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:31,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:08:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:08:31,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:08:31,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469262918] [2024-10-14 14:08:31,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469262918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:08:31,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:08:31,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 14:08:31,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933907756] [2024-10-14 14:08:31,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:08:31,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:08:31,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:08:31,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:08:31,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:08:31,019 INFO L87 Difference]: Start difference. First operand 107 states and 156 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:08:31,290 INFO L93 Difference]: Finished difference Result 274 states and 400 transitions. [2024-10-14 14:08:31,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:08:31,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-14 14:08:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:08:31,295 INFO L225 Difference]: With dead ends: 274 [2024-10-14 14:08:31,295 INFO L226 Difference]: Without dead ends: 168 [2024-10-14 14:08:31,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 14:08:31,297 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 339 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:08:31,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 386 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:08:31,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-14 14:08:31,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 122. [2024-10-14 14:08:31,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 108 states have (on average 1.4444444444444444) internal successors, (156), 108 states have internal predecessors, (156), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:08:31,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2024-10-14 14:08:31,326 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 102 [2024-10-14 14:08:31,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:08:31,326 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2024-10-14 14:08:31,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:31,327 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2024-10-14 14:08:31,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 14:08:31,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:31,328 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:31,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 14:08:31,328 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:31,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:31,329 INFO L85 PathProgramCache]: Analyzing trace with hash 543737146, now seen corresponding path program 1 times [2024-10-14 14:08:31,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:08:31,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285403369] [2024-10-14 14:08:31,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:31,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:08:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:32,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:08:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:32,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:08:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:32,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:08:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:32,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:08:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:32,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:08:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:32,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:08:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:32,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:08:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:32,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:08:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:32,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:08:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:32,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:08:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:32,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:08:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:32,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:08:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:08:32,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:08:32,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285403369] [2024-10-14 14:08:32,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285403369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:08:32,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:08:32,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 14:08:32,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073976600] [2024-10-14 14:08:32,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:08:32,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:08:32,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:08:32,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:08:32,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:08:32,551 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 14:08:32,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:08:32,802 INFO L93 Difference]: Finished difference Result 304 states and 451 transitions. [2024-10-14 14:08:32,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:08:32,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-10-14 14:08:32,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:08:32,805 INFO L225 Difference]: With dead ends: 304 [2024-10-14 14:08:32,805 INFO L226 Difference]: Without dead ends: 183 [2024-10-14 14:08:32,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-14 14:08:32,806 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 139 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:08:32,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 420 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:08:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-14 14:08:32,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 168. [2024-10-14 14:08:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 141 states have (on average 1.4113475177304964) internal successors, (199), 141 states have internal predecessors, (199), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 14:08:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 247 transitions. [2024-10-14 14:08:32,825 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 247 transitions. Word has length 103 [2024-10-14 14:08:32,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:08:32,825 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 247 transitions. [2024-10-14 14:08:32,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 14:08:32,826 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 247 transitions. [2024-10-14 14:08:32,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 14:08:32,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:32,827 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:32,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 14:08:32,827 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:32,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:32,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1145206596, now seen corresponding path program 1 times [2024-10-14 14:08:32,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:08:32,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705472629] [2024-10-14 14:08:32,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:32,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:08:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:34,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:08:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:34,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:08:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:34,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:08:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:34,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:08:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:34,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:08:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:34,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:08:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:34,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:08:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:34,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:08:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:34,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:08:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:34,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:08:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:34,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:08:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:34,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:08:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:08:34,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:08:34,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705472629] [2024-10-14 14:08:34,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705472629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:08:34,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:08:34,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 14:08:34,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388207477] [2024-10-14 14:08:34,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:08:34,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 14:08:34,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:08:34,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 14:08:34,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:08:34,157 INFO L87 Difference]: Start difference. First operand 168 states and 247 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 14:08:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:08:34,539 INFO L93 Difference]: Finished difference Result 391 states and 574 transitions. [2024-10-14 14:08:34,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:08:34,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-10-14 14:08:34,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:08:34,542 INFO L225 Difference]: With dead ends: 391 [2024-10-14 14:08:34,542 INFO L226 Difference]: Without dead ends: 270 [2024-10-14 14:08:34,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-10-14 14:08:34,544 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 285 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 14:08:34,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 459 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 14:08:34,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-14 14:08:34,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 214. [2024-10-14 14:08:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 187 states have (on average 1.4171122994652405) internal successors, (265), 187 states have internal predecessors, (265), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 14:08:34,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 313 transitions. [2024-10-14 14:08:34,565 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 313 transitions. Word has length 103 [2024-10-14 14:08:34,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:08:34,566 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 313 transitions. [2024-10-14 14:08:34,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 14:08:34,566 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 313 transitions. [2024-10-14 14:08:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 14:08:34,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:34,569 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:34,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 14:08:34,570 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:34,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:34,571 INFO L85 PathProgramCache]: Analyzing trace with hash -887041158, now seen corresponding path program 1 times [2024-10-14 14:08:34,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:08:34,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884065859] [2024-10-14 14:08:34,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:34,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:08:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:35,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:08:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:35,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:08:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:35,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:08:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:35,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:08:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:35,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:08:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:35,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:08:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:35,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:08:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:35,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:08:35,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:35,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:08:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:35,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:08:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:35,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:08:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:35,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:08:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:08:35,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:08:35,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884065859] [2024-10-14 14:08:35,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884065859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:08:35,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:08:35,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 14:08:35,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145443666] [2024-10-14 14:08:35,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:08:35,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:08:35,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:08:35,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:08:35,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:08:35,053 INFO L87 Difference]: Start difference. First operand 214 states and 313 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:08:35,314 INFO L93 Difference]: Finished difference Result 521 states and 754 transitions. [2024-10-14 14:08:35,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:08:35,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2024-10-14 14:08:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:08:35,316 INFO L225 Difference]: With dead ends: 521 [2024-10-14 14:08:35,316 INFO L226 Difference]: Without dead ends: 308 [2024-10-14 14:08:35,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 14:08:35,319 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 226 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:08:35,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 569 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:08:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-14 14:08:35,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 238. [2024-10-14 14:08:35,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 211 states have (on average 1.3981042654028435) internal successors, (295), 211 states have internal predecessors, (295), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 14:08:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 343 transitions. [2024-10-14 14:08:35,338 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 343 transitions. Word has length 103 [2024-10-14 14:08:35,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:08:35,338 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 343 transitions. [2024-10-14 14:08:35,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 343 transitions. [2024-10-14 14:08:35,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 14:08:35,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:35,340 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:35,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 14:08:35,340 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:35,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:35,341 INFO L85 PathProgramCache]: Analyzing trace with hash -897261820, now seen corresponding path program 1 times [2024-10-14 14:08:35,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:08:35,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396925968] [2024-10-14 14:08:35,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:35,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:08:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:36,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:08:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:36,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:08:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:36,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:08:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:36,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:08:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:36,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:08:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:36,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:08:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:36,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:08:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:36,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:08:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:36,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:08:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:36,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:08:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:36,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:08:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:36,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:08:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:36,232 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:08:36,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:08:36,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396925968] [2024-10-14 14:08:36,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396925968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:08:36,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:08:36,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 14:08:36,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913754539] [2024-10-14 14:08:36,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:08:36,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 14:08:36,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:08:36,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 14:08:36,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-14 14:08:36,235 INFO L87 Difference]: Start difference. First operand 238 states and 343 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 14:08:36,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:08:36,860 INFO L93 Difference]: Finished difference Result 505 states and 725 transitions. [2024-10-14 14:08:36,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:08:36,861 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2024-10-14 14:08:36,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:08:36,863 INFO L225 Difference]: With dead ends: 505 [2024-10-14 14:08:36,863 INFO L226 Difference]: Without dead ends: 369 [2024-10-14 14:08:36,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-10-14 14:08:36,865 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 298 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 14:08:36,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 566 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 14:08:36,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-14 14:08:36,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 236. [2024-10-14 14:08:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 209 states have (on average 1.3923444976076556) internal successors, (291), 209 states have internal predecessors, (291), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 14:08:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 339 transitions. [2024-10-14 14:08:36,887 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 339 transitions. Word has length 104 [2024-10-14 14:08:36,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:08:36,887 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 339 transitions. [2024-10-14 14:08:36,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 14:08:36,888 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 339 transitions. [2024-10-14 14:08:36,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 14:08:36,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:36,889 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:36,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 14:08:36,889 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:36,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:36,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1669691508, now seen corresponding path program 1 times [2024-10-14 14:08:36,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:08:36,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860353048] [2024-10-14 14:08:36,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:36,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:08:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:37,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:08:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:37,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:08:37,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:37,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:08:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:37,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:08:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:37,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:08:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:37,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:08:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:37,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:08:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:37,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:08:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:37,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:08:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:37,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:08:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:37,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:08:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:37,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:08:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:08:37,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:08:37,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860353048] [2024-10-14 14:08:37,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860353048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:08:37,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:08:37,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 14:08:37,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636850434] [2024-10-14 14:08:37,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:08:37,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 14:08:37,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:08:37,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 14:08:37,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:08:37,406 INFO L87 Difference]: Start difference. First operand 236 states and 339 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 14:08:37,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:08:37,879 INFO L93 Difference]: Finished difference Result 463 states and 668 transitions. [2024-10-14 14:08:37,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:08:37,879 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-10-14 14:08:37,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:08:37,881 INFO L225 Difference]: With dead ends: 463 [2024-10-14 14:08:37,881 INFO L226 Difference]: Without dead ends: 329 [2024-10-14 14:08:37,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-14 14:08:37,882 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 217 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 14:08:37,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 638 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 14:08:37,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-14 14:08:37,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 254. [2024-10-14 14:08:37,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 227 states have (on average 1.4008810572687225) internal successors, (318), 227 states have internal predecessors, (318), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 14:08:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 366 transitions. [2024-10-14 14:08:37,907 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 366 transitions. Word has length 104 [2024-10-14 14:08:37,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:08:37,907 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 366 transitions. [2024-10-14 14:08:37,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 14:08:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 366 transitions. [2024-10-14 14:08:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 14:08:37,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:37,909 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:37,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 14:08:37,910 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:37,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2038469774, now seen corresponding path program 1 times [2024-10-14 14:08:37,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:08:37,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137210973] [2024-10-14 14:08:37,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:37,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:08:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:38,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:08:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:38,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:08:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:38,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:08:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:38,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:08:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:38,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:08:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:38,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:08:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:38,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:08:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:38,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:08:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:38,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:08:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:38,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:08:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:38,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:08:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:38,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:08:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:38,329 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:08:38,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:08:38,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137210973] [2024-10-14 14:08:38,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137210973] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:08:38,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:08:38,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 14:08:38,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475008140] [2024-10-14 14:08:38,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:08:38,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 14:08:38,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:08:38,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 14:08:38,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 14:08:38,332 INFO L87 Difference]: Start difference. First operand 254 states and 366 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:38,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:08:38,721 INFO L93 Difference]: Finished difference Result 480 states and 692 transitions. [2024-10-14 14:08:38,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 14:08:38,722 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-10-14 14:08:38,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:08:38,725 INFO L225 Difference]: With dead ends: 480 [2024-10-14 14:08:38,725 INFO L226 Difference]: Without dead ends: 328 [2024-10-14 14:08:38,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-14 14:08:38,727 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 196 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 14:08:38,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 1034 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 14:08:38,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-14 14:08:38,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 256. [2024-10-14 14:08:38,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 229 states have (on average 1.3973799126637554) internal successors, (320), 229 states have internal predecessors, (320), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 14:08:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 368 transitions. [2024-10-14 14:08:38,753 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 368 transitions. Word has length 104 [2024-10-14 14:08:38,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:08:38,753 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 368 transitions. [2024-10-14 14:08:38,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:38,754 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 368 transitions. [2024-10-14 14:08:38,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 14:08:38,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:38,755 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:38,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 14:08:38,755 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:38,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:38,756 INFO L85 PathProgramCache]: Analyzing trace with hash 135746826, now seen corresponding path program 1 times [2024-10-14 14:08:38,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:08:38,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734744071] [2024-10-14 14:08:38,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:38,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:08:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:39,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:08:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:39,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:08:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:39,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:08:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:39,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:08:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:39,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:08:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:39,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:08:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:39,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:08:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:39,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:08:39,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:39,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:08:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:39,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:08:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:39,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:08:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:39,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:08:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:08:39,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:08:39,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734744071] [2024-10-14 14:08:39,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734744071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:08:39,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:08:39,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 14:08:39,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561046548] [2024-10-14 14:08:39,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:08:39,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 14:08:39,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:08:39,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 14:08:39,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-14 14:08:39,510 INFO L87 Difference]: Start difference. First operand 256 states and 368 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:08:40,072 INFO L93 Difference]: Finished difference Result 509 states and 733 transitions. [2024-10-14 14:08:40,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 14:08:40,072 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-10-14 14:08:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:08:40,075 INFO L225 Difference]: With dead ends: 509 [2024-10-14 14:08:40,075 INFO L226 Difference]: Without dead ends: 355 [2024-10-14 14:08:40,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-10-14 14:08:40,077 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 289 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 14:08:40,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1165 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 14:08:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-14 14:08:40,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 271. [2024-10-14 14:08:40,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 244 states have (on average 1.4139344262295082) internal successors, (345), 244 states have internal predecessors, (345), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 14:08:40,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 393 transitions. [2024-10-14 14:08:40,102 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 393 transitions. Word has length 104 [2024-10-14 14:08:40,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:08:40,102 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 393 transitions. [2024-10-14 14:08:40,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:40,103 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 393 transitions. [2024-10-14 14:08:40,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 14:08:40,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:40,104 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:40,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 14:08:40,104 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:40,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:40,105 INFO L85 PathProgramCache]: Analyzing trace with hash -451059188, now seen corresponding path program 1 times [2024-10-14 14:08:40,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:08:40,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72941741] [2024-10-14 14:08:40,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:40,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:08:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:40,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:08:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:40,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:08:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:40,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:08:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:40,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:08:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:40,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:08:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:40,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:08:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:40,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:08:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:40,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:08:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:40,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:08:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:40,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:08:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:40,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:08:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:40,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:08:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:08:40,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:08:40,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72941741] [2024-10-14 14:08:40,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72941741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:08:40,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:08:40,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 14:08:40,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556540152] [2024-10-14 14:08:40,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:08:40,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 14:08:40,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:08:40,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 14:08:40,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 14:08:40,571 INFO L87 Difference]: Start difference. First operand 271 states and 393 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:08:40,904 INFO L93 Difference]: Finished difference Result 510 states and 740 transitions. [2024-10-14 14:08:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:08:40,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-10-14 14:08:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:08:40,907 INFO L225 Difference]: With dead ends: 510 [2024-10-14 14:08:40,907 INFO L226 Difference]: Without dead ends: 341 [2024-10-14 14:08:40,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:08:40,908 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 272 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 14:08:40,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 650 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 14:08:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-10-14 14:08:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 271. [2024-10-14 14:08:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 244 states have (on average 1.4057377049180328) internal successors, (343), 244 states have internal predecessors, (343), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 14:08:40,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 391 transitions. [2024-10-14 14:08:40,934 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 391 transitions. Word has length 104 [2024-10-14 14:08:40,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:08:40,934 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 391 transitions. [2024-10-14 14:08:40,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 391 transitions. [2024-10-14 14:08:40,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 14:08:40,935 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:40,936 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:40,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 14:08:40,936 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:40,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:40,936 INFO L85 PathProgramCache]: Analyzing trace with hash -461388440, now seen corresponding path program 1 times [2024-10-14 14:08:40,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:08:40,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867168825] [2024-10-14 14:08:40,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:40,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:08:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:41,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:08:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:41,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:08:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:41,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:08:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:41,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:08:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:08:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:41,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:08:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:41,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:08:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:41,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:08:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:41,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:08:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:41,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:08:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:41,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 14:08:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:41,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 14:08:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:08:41,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:08:41,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867168825] [2024-10-14 14:08:41,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867168825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:08:41,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:08:41,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 14:08:41,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675584922] [2024-10-14 14:08:41,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:08:41,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 14:08:41,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:08:41,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 14:08:41,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 14:08:41,348 INFO L87 Difference]: Start difference. First operand 271 states and 391 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:08:41,621 INFO L93 Difference]: Finished difference Result 346 states and 495 transitions. [2024-10-14 14:08:41,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:08:41,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2024-10-14 14:08:41,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:08:41,624 INFO L225 Difference]: With dead ends: 346 [2024-10-14 14:08:41,625 INFO L226 Difference]: Without dead ends: 344 [2024-10-14 14:08:41,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:08:41,627 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 193 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:08:41,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 501 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:08:41,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-14 14:08:41,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 327. [2024-10-14 14:08:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 300 states have (on average 1.4133333333333333) internal successors, (424), 300 states have internal predecessors, (424), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 14:08:41,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 472 transitions. [2024-10-14 14:08:41,652 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 472 transitions. Word has length 105 [2024-10-14 14:08:41,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:08:41,654 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 472 transitions. [2024-10-14 14:08:41,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:41,655 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 472 transitions. [2024-10-14 14:08:41,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 14:08:41,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:41,656 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:41,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 14:08:41,657 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:41,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:41,657 INFO L85 PathProgramCache]: Analyzing trace with hash -461328858, now seen corresponding path program 1 times [2024-10-14 14:08:41,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:08:41,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462724838] [2024-10-14 14:08:41,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:41,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:08:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 14:08:41,751 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 14:08:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 14:08:41,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 14:08:41,884 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 14:08:41,886 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 14:08:41,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 14:08:41,890 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:42,025 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 14:08:42,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:08:42 BoogieIcfgContainer [2024-10-14 14:08:42,030 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 14:08:42,030 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 14:08:42,031 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 14:08:42,031 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 14:08:42,031 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:08:28" (3/4) ... [2024-10-14 14:08:42,034 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 14:08:42,035 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 14:08:42,036 INFO L158 Benchmark]: Toolchain (without parser) took 14864.16ms. Allocated memory was 144.7MB in the beginning and 411.0MB in the end (delta: 266.3MB). Free memory was 112.4MB in the beginning and 211.4MB in the end (delta: -99.0MB). Peak memory consumption was 167.1MB. Max. memory is 16.1GB. [2024-10-14 14:08:42,036 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 144.7MB. Free memory is still 112.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 14:08:42,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.34ms. Allocated memory is still 144.7MB. Free memory was 112.4MB in the beginning and 96.9MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 14:08:42,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.10ms. Allocated memory is still 144.7MB. Free memory was 96.4MB in the beginning and 92.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 14:08:42,036 INFO L158 Benchmark]: Boogie Preprocessor took 71.90ms. Allocated memory is still 144.7MB. Free memory was 92.7MB in the beginning and 88.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 14:08:42,037 INFO L158 Benchmark]: RCFGBuilder took 802.21ms. Allocated memory is still 144.7MB. Free memory was 88.5MB in the beginning and 86.3MB in the end (delta: 2.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 14:08:42,037 INFO L158 Benchmark]: TraceAbstraction took 13513.02ms. Allocated memory was 144.7MB in the beginning and 411.0MB in the end (delta: 266.3MB). Free memory was 85.2MB in the beginning and 211.4MB in the end (delta: -126.2MB). Peak memory consumption was 142.2MB. Max. memory is 16.1GB. [2024-10-14 14:08:42,037 INFO L158 Benchmark]: Witness Printer took 4.80ms. Allocated memory is still 411.0MB. Free memory is still 211.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 14:08:42,039 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 144.7MB. Free memory is still 112.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.34ms. Allocated memory is still 144.7MB. Free memory was 112.4MB in the beginning and 96.9MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.10ms. Allocated memory is still 144.7MB. Free memory was 96.4MB in the beginning and 92.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.90ms. Allocated memory is still 144.7MB. Free memory was 92.7MB in the beginning and 88.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 802.21ms. Allocated memory is still 144.7MB. Free memory was 88.5MB in the beginning and 86.3MB in the end (delta: 2.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13513.02ms. Allocated memory was 144.7MB in the beginning and 411.0MB in the end (delta: 266.3MB). Free memory was 85.2MB in the beginning and 211.4MB in the end (delta: -126.2MB). Peak memory consumption was 142.2MB. Max. memory is 16.1GB. * Witness Printer took 4.80ms. Allocated memory is still 411.0MB. Free memory is still 211.4MB. 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 113, overapproximation of someBinaryFLOATComparisonOperation at line 121. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 16, 10, 0, 1, 0, 0, 9.75, 5.5, 4.1, 9.8, 25, 2 }; [L51] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] unsigned char* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L53] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L54] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L55] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L56] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L57] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L58] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L59] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L60] float* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L61] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L62] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] FCALL updateLastVariables() [L129] CALL updateVariables() [L98] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L101] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L103] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L104] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L107] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L109] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L110] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_12 [L111] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_12 [L111] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L111] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L111] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L112] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L113] EXPR WrapperStruct00.var_1_13 [L113] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_13 [L113] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L113] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L113] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L114] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L115] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L116] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L129] RET updateVariables() [L130] CALL step() [L66] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L66] (*(WrapperStruct00_var_1_14_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L67] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L67] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_16_Pointer)) [L68] signed long int stepLocal_0 = -4; [L69] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L69] COND FALSE !(stepLocal_0 >= (*(WrapperStruct00_var_1_15_Pointer))) [L72] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L72] unsigned char stepLocal_2 = (*(WrapperStruct00_var_1_3_Pointer)); [L73] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L73] COND FALSE !((*(WrapperStruct00_var_1_9_Pointer))) [L82] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L82] EXPR ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer))) [L82] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L82] EXPR ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1, stepLocal_2=254] [L82] signed long int stepLocal_1 = (((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))); [L83] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L83] COND FALSE !((8 * (*(WrapperStruct00_var_1_1_Pointer))) == stepLocal_1) [L94] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L94] (*(WrapperStruct00_var_1_4_Pointer)) = (*(WrapperStruct00_var_1_10_Pointer)) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR (-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 [L121] EXPR (-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR ((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR ((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer))) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR ((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR ((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L121] EXPR ((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR ((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR (((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR (((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR (*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1 [L121] EXPR (*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR (((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR ((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR ((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L121] EXPR ((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR (((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121] EXPR (((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L121-L122] return (((((-4 >= (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_3_Pointer))) < (((((1) < 0 ) ? -(1) : (1))))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : (((((1) < 0 ) ? -(1) : (1)))))))) : 1) && (((8 * (*(WrapperStruct00_var_1_1_Pointer))) == ((((10) > ((*(WrapperStruct00_var_1_1_Pointer)))) ? (10) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_11_Pointer)) < (*(WrapperStruct00_var_1_14_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_14_Pointer)) >= (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) 0)))) : ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_10_Pointer)))))) && ((*(WrapperStruct00_var_1_9_Pointer)) ? (((*(WrapperStruct00_var_1_3_Pointer)) > (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((((((*(WrapperStruct00_var_1_12_Pointer))) > (16.5)) ? ((*(WrapperStruct00_var_1_12_Pointer))) : (16.5)))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_10_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_12_Pointer)))) : 1)) : 1)) && ((*(WrapperStruct00_var_1_14_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:5}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:22}, WrapperStruct00_var_1_14_Pointer={4:30}, WrapperStruct00_var_1_15_Pointer={4:34}, WrapperStruct00_var_1_16_Pointer={4:35}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_9_Pointer={4:4}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 15, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2456 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2456 mSDsluCounter, 7807 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5847 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3617 IncrementalHoareTripleChecker+Invalid, 3748 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 1960 mSDtfsCounter, 3617 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 484 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=327occurred in iteration=14, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 640 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1545 NumberOfCodeBlocks, 1545 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1426 ConstructedInterpolants, 0 QuantifiedInterpolants, 8451 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 3696/3696 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 14:08:42,078 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.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 a4adac79d6cea52ff1f2363c41bfef3a91ebf33bfb8642b8f2d3700c04ed5429 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:08:44,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:08:44,518 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 14:08:44,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:08:44,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:08:44,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:08:44,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:08:44,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:08:44,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:08:44,568 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:08:44,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:08:44,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:08:44,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:08:44,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:08:44,570 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:08:44,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:08:44,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:08:44,573 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:08:44,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:08:44,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:08:44,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:08:44,578 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:08:44,578 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:08:44,579 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 14:08:44,579 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 14:08:44,579 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:08:44,579 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 14:08:44,580 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:08:44,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:08:44,580 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:08:44,581 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:08:44,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:08:44,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:08:44,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:08:44,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:08:44,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:08:44,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:08:44,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:08:44,584 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 14:08:44,584 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 14:08:44,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:08:44,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:08:44,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:08:44,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:08:44,586 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 14:08:44,586 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 -> a4adac79d6cea52ff1f2363c41bfef3a91ebf33bfb8642b8f2d3700c04ed5429 [2024-10-14 14:08:44,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:08:44,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:08:44,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:08:44,968 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:08:44,968 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:08:44,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i [2024-10-14 14:08:46,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:08:46,700 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:08:46,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i [2024-10-14 14:08:46,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e587d8ee/7b07e2a1e83d43698ba7b73d0c735a03/FLAG98396464a [2024-10-14 14:08:47,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e587d8ee/7b07e2a1e83d43698ba7b73d0c735a03 [2024-10-14 14:08:47,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:08:47,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:08:47,059 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:08:47,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:08:47,065 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:08:47,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:08:47" (1/1) ... [2024-10-14 14:08:47,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51182453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:47, skipping insertion in model container [2024-10-14 14:08:47,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:08:47" (1/1) ... [2024-10-14 14:08:47,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:08:47,266 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i[917,930] [2024-10-14 14:08:47,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:08:47,373 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:08:47,386 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-54.i[917,930] [2024-10-14 14:08:47,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:08:47,446 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:08:47,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:47 WrapperNode [2024-10-14 14:08:47,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:08:47,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:08:47,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:08:47,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:08:47,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:47" (1/1) ... [2024-10-14 14:08:47,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:47" (1/1) ... [2024-10-14 14:08:47,507 INFO L138 Inliner]: procedures = 33, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 473 [2024-10-14 14:08:47,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:08:47,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:08:47,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:08:47,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:08:47,520 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:47" (1/1) ... [2024-10-14 14:08:47,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:47" (1/1) ... [2024-10-14 14:08:47,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:47" (1/1) ... [2024-10-14 14:08:47,576 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2024-10-14 14:08:47,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:47" (1/1) ... [2024-10-14 14:08:47,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:47" (1/1) ... [2024-10-14 14:08:47,606 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:47" (1/1) ... [2024-10-14 14:08:47,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:47" (1/1) ... [2024-10-14 14:08:47,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:47" (1/1) ... [2024-10-14 14:08:47,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:47" (1/1) ... [2024-10-14 14:08:47,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:08:47,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:08:47,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:08:47,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:08:47,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:47" (1/1) ... [2024-10-14 14:08:47,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:08:47,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:08:47,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 14:08:47,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 14:08:47,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:08:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-14 14:08:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-14 14:08:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-14 14:08:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-14 14:08:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 14:08:47,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 14:08:47,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 14:08:47,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 14:08:47,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-14 14:08:47,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-14 14:08:47,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-14 14:08:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-14 14:08:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-14 14:08:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-14 14:08:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-14 14:08:47,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-14 14:08:47,728 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 14:08:47,728 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 14:08:47,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:08:47,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:08:47,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-14 14:08:47,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-14 14:08:47,885 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:08:47,888 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:08:49,295 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-10-14 14:08:49,297 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:08:49,368 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:08:49,370 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 14:08:49,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:08:49 BoogieIcfgContainer [2024-10-14 14:08:49,371 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:08:49,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:08:49,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:08:49,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:08:49,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:08:47" (1/3) ... [2024-10-14 14:08:49,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5e56d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:08:49, skipping insertion in model container [2024-10-14 14:08:49,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:08:47" (2/3) ... [2024-10-14 14:08:49,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5e56d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:08:49, skipping insertion in model container [2024-10-14 14:08:49,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:08:49" (3/3) ... [2024-10-14 14:08:49,380 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-54.i [2024-10-14 14:08:49,397 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:08:49,398 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 14:08:49,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:08:49,472 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;@6a50fb78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:08:49,473 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 14:08:49,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:08:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 14:08:49,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:49,491 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:49,491 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:49,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:49,499 INFO L85 PathProgramCache]: Analyzing trace with hash 49234744, now seen corresponding path program 1 times [2024-10-14 14:08:49,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:08:49,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250686702] [2024-10-14 14:08:49,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:49,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:08:49,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:08:49,517 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:08:49,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 14:08:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:49,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 14:08:49,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:08:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-14 14:08:49,966 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:08:49,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:08:49,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250686702] [2024-10-14 14:08:49,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250686702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:08:49,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:08:49,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:08:49,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476761688] [2024-10-14 14:08:49,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:08:49,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 14:08:49,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:08:50,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 14:08:50,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:08:50,008 INFO L87 Difference]: Start difference. First operand has 103 states, 88 states have (on average 1.4886363636363635) internal successors, (131), 89 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 14:08:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:08:50,140 INFO L93 Difference]: Finished difference Result 203 states and 320 transitions. [2024-10-14 14:08:50,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 14:08:50,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-10-14 14:08:50,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:08:50,153 INFO L225 Difference]: With dead ends: 203 [2024-10-14 14:08:50,154 INFO L226 Difference]: Without dead ends: 101 [2024-10-14 14:08:50,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:08:50,164 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:08:50,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:08:50,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-14 14:08:50,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-14 14:08:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 87 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:08:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2024-10-14 14:08:50,220 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 100 [2024-10-14 14:08:50,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:08:50,221 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2024-10-14 14:08:50,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 14:08:50,221 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2024-10-14 14:08:50,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 14:08:50,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:50,226 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:50,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 14:08:50,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:08:50,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:50,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:50,432 INFO L85 PathProgramCache]: Analyzing trace with hash 639984100, now seen corresponding path program 1 times [2024-10-14 14:08:50,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:08:50,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144483910] [2024-10-14 14:08:50,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:50,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:08:50,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:08:50,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:08:50,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 14:08:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:50,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 14:08:50,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:08:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:08:50,835 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:08:50,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:08:50,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144483910] [2024-10-14 14:08:50,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144483910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:08:50,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:08:50,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:08:50,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176297570] [2024-10-14 14:08:50,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:08:50,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:08:50,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:08:50,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:08:50,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:08:50,839 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:08:51,097 INFO L93 Difference]: Finished difference Result 203 states and 302 transitions. [2024-10-14 14:08:51,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:08:51,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2024-10-14 14:08:51,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:08:51,101 INFO L225 Difference]: With dead ends: 203 [2024-10-14 14:08:51,102 INFO L226 Difference]: Without dead ends: 103 [2024-10-14 14:08:51,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:08:51,103 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:08:51,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:08:51,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-14 14:08:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-14 14:08:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 89 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:08:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2024-10-14 14:08:51,132 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 100 [2024-10-14 14:08:51,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:08:51,137 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-10-14 14:08:51,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:51,138 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2024-10-14 14:08:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 14:08:51,141 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:51,141 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:51,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 14:08:51,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:08:51,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:51,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:51,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1387866121, now seen corresponding path program 1 times [2024-10-14 14:08:51,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:08:51,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419342565] [2024-10-14 14:08:51,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:51,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:08:51,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:08:51,345 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:08:51,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 14:08:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:51,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 14:08:51,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:08:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:08:51,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:08:51,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:08:51,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419342565] [2024-10-14 14:08:51,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419342565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:08:51,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:08:51,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 14:08:51,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979655546] [2024-10-14 14:08:51,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:08:51,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:08:51,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:08:51,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:08:51,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:08:51,708 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:08:52,247 INFO L93 Difference]: Finished difference Result 210 states and 310 transitions. [2024-10-14 14:08:52,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:08:52,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-14 14:08:52,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:08:52,250 INFO L225 Difference]: With dead ends: 210 [2024-10-14 14:08:52,251 INFO L226 Difference]: Without dead ends: 108 [2024-10-14 14:08:52,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:08:52,255 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 14:08:52,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 554 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 14:08:52,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-14 14:08:52,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-10-14 14:08:52,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 93 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:08:52,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 156 transitions. [2024-10-14 14:08:52,269 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 156 transitions. Word has length 102 [2024-10-14 14:08:52,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:08:52,269 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 156 transitions. [2024-10-14 14:08:52,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 156 transitions. [2024-10-14 14:08:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 14:08:52,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:52,272 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:52,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 14:08:52,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:08:52,473 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:52,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:52,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1445124423, now seen corresponding path program 1 times [2024-10-14 14:08:52,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:08:52,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381283623] [2024-10-14 14:08:52,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:52,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:08:52,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:08:52,477 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:08:52,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 14:08:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:52,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 14:08:52,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:08:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-14 14:08:52,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 14:08:52,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 14:08:52,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381283623] [2024-10-14 14:08:52,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381283623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:08:52,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:08:52,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:08:52,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415992583] [2024-10-14 14:08:52,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:08:52,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:08:52,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 14:08:52,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:08:52,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:08:52,854 INFO L87 Difference]: Start difference. First operand 107 states and 156 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:53,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:08:53,264 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2024-10-14 14:08:53,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:08:53,265 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2024-10-14 14:08:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:08:53,267 INFO L225 Difference]: With dead ends: 216 [2024-10-14 14:08:53,267 INFO L226 Difference]: Without dead ends: 110 [2024-10-14 14:08:53,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:08:53,269 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 14:08:53,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 688 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 14:08:53,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-14 14:08:53,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-10-14 14:08:53,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 95 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 14:08:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 158 transitions. [2024-10-14 14:08:53,279 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 158 transitions. Word has length 102 [2024-10-14 14:08:53,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:08:53,280 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 158 transitions. [2024-10-14 14:08:53,280 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-14 14:08:53,280 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 158 transitions. [2024-10-14 14:08:53,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 14:08:53,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:08:53,283 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:08:53,293 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 (5)] Forceful destruction successful, exit code 0 [2024-10-14 14:08:53,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:08:53,484 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:08:53,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:08:53,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1445184005, now seen corresponding path program 1 times [2024-10-14 14:08:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 14:08:53,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108926716] [2024-10-14 14:08:53,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:08:53,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 14:08:53,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 14:08:53,487 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 14:08:53,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 14:08:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:08:53,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 14:08:53,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:08:54,018 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 24 treesize of output 12 [2024-10-14 14:08:54,535 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-10-14 14:08:55,180 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 29 treesize of output 31 [2024-10-14 14:08:55,859 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 40 treesize of output 34 [2024-10-14 14:08:56,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-10-14 14:08:59,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2024-10-14 14:09:06,890 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 53 treesize of output 64 [2024-10-14 14:09:07,612 INFO L349 Elim1Store]: treesize reduction 166, result has 21.3 percent of original size [2024-10-14 14:09:07,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 23 case distinctions, treesize of input 115 treesize of output 229 [2024-10-14 14:09:07,828 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-10-14 14:09:07,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 120 treesize of output 109 [2024-10-14 14:09:07,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 72 treesize of output 54 [2024-10-14 14:09:08,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 14:09:08,063 INFO L349 Elim1Store]: treesize reduction 49, result has 14.0 percent of original size [2024-10-14 14:09:08,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 29 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 7 case distinctions, treesize of input 84 treesize of output 72 [2024-10-14 14:09:09,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 84 treesize of output 60 [2024-10-14 14:09:18,353 WARN L286 SmtUtils]: Spent 7.09s on a formula simplification. DAG size of input: 476 DAG size of output: 380 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-10-14 14:09:18,354 INFO L349 Elim1Store]: treesize reduction 576, result has 65.2 percent of original size [2024-10-14 14:09:18,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 29 select indices, 29 select index equivalence classes, 28 disjoint index pairs (out of 406 index pairs), introduced 29 new quantified variables, introduced 406 case distinctions, treesize of input 452 treesize of output 1292