./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-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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-26.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 3291167999bb7bd7f68091110884d1151ee296ff17c178c4f709963149d4b67b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:56:51,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:56:51,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:56:51,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:56:51,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:56:51,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:56:51,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:56:51,394 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:56:51,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:56:51,397 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:56:51,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:56:51,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:56:51,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:56:51,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:56:51,401 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:56:51,401 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:56:51,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:56:51,402 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:56:51,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:56:51,402 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:56:51,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:56:51,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:56:51,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:56:51,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:56:51,404 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:56:51,404 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:56:51,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:56:51,405 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:56:51,405 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:56:51,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:56:51,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:56:51,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:56:51,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:56:51,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:56:51,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:56:51,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:56:51,407 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:56:51,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:56:51,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:56:51,407 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:56:51,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:56:51,409 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:56:51,409 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 -> 3291167999bb7bd7f68091110884d1151ee296ff17c178c4f709963149d4b67b [2024-10-24 11:56:51,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:56:51,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:56:51,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:56:51,716 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:56:51,716 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:56:51,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i [2024-10-24 11:56:53,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:56:53,323 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:56:53,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i [2024-10-24 11:56:53,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e6f7de6/156a4da0d0084202a690b7303fb30ac8/FLAG0b74fed35 [2024-10-24 11:56:53,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e6f7de6/156a4da0d0084202a690b7303fb30ac8 [2024-10-24 11:56:53,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:56:53,361 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:56:53,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:56:53,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:56:53,369 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:56:53,370 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:56:53" (1/1) ... [2024-10-24 11:56:53,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55a5ff9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:53, skipping insertion in model container [2024-10-24 11:56:53,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:56:53" (1/1) ... [2024-10-24 11:56:53,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:56:53,623 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-26.i[917,930] [2024-10-24 11:56:53,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:56:53,716 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:56:53,729 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-26.i[917,930] [2024-10-24 11:56:53,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:56:53,812 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:56:53,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:53 WrapperNode [2024-10-24 11:56:53,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:56:53,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:56:53,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:56:53,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:56:53,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:53" (1/1) ... [2024-10-24 11:56:53,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:53" (1/1) ... [2024-10-24 11:56:53,877 INFO L138 Inliner]: procedures = 29, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 482 [2024-10-24 11:56:53,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:56:53,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:56:53,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:56:53,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:56:53,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:53" (1/1) ... [2024-10-24 11:56:53,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:53" (1/1) ... [2024-10-24 11:56:53,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:53" (1/1) ... [2024-10-24 11:56:53,936 INFO L175 MemorySlicer]: Split 129 memory accesses to 2 slices as follows [2, 127]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 11 writes are split as follows [0, 11]. [2024-10-24 11:56:53,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:53" (1/1) ... [2024-10-24 11:56:53,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:53" (1/1) ... [2024-10-24 11:56:53,953 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:53" (1/1) ... [2024-10-24 11:56:53,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:53" (1/1) ... [2024-10-24 11:56:53,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:53" (1/1) ... [2024-10-24 11:56:53,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:53" (1/1) ... [2024-10-24 11:56:53,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:56:53,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:56:53,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:56:53,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:56:53,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:53" (1/1) ... [2024-10-24 11:56:53,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:56:54,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:56:54,018 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-24 11:56:54,024 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-24 11:56:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:56:54,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:56:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:56:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:56:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:56:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:56:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:56:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:56:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:56:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:56:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:56:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:56:54,082 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:56:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:56:54,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:56:54,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:56:54,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:56:54,230 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:56:54,233 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:56:54,829 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-10-24 11:56:54,831 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:56:54,881 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:56:54,882 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:56:54,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:56:54 BoogieIcfgContainer [2024-10-24 11:56:54,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:56:54,886 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:56:54,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:56:54,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:56:54,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:56:53" (1/3) ... [2024-10-24 11:56:54,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea3c06f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:56:54, skipping insertion in model container [2024-10-24 11:56:54,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:56:53" (2/3) ... [2024-10-24 11:56:54,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea3c06f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:56:54, skipping insertion in model container [2024-10-24 11:56:54,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:56:54" (3/3) ... [2024-10-24 11:56:54,893 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-26.i [2024-10-24 11:56:54,911 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:56:54,911 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:56:54,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:56:54,985 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;@1a3f9d37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:56:54,986 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:56:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:56:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:56:55,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:55,029 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:56:55,033 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:55,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:55,041 INFO L85 PathProgramCache]: Analyzing trace with hash -483601842, now seen corresponding path program 1 times [2024-10-24 11:56:55,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:55,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091342413] [2024-10-24 11:56:55,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:55,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:56:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:56:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:56:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:56:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:56:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,487 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:56:55,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:55,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091342413] [2024-10-24 11:56:55,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091342413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:55,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:55,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:56:55,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150330600] [2024-10-24 11:56:55,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:55,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:56:55,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:55,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:56:55,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:56:55,524 INFO L87 Difference]: Start difference. First operand has 86 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:56:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:55,572 INFO L93 Difference]: Finished difference Result 169 states and 261 transitions. [2024-10-24 11:56:55,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:56:55,575 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-10-24 11:56:55,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:55,584 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:56:55,584 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 11:56:55,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-24 11:56:55,593 INFO L432 NwaCegarLoop]: 118 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, 118 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-24 11:56:55,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:56:55,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 11:56:55,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 11:56:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:56:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 122 transitions. [2024-10-24 11:56:55,648 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 122 transitions. Word has length 84 [2024-10-24 11:56:55,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:55,649 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 122 transitions. [2024-10-24 11:56:55,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:56:55,650 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 122 transitions. [2024-10-24 11:56:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:56:55,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:55,655 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:56:55,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:56:55,655 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:55,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:55,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1312447424, now seen corresponding path program 1 times [2024-10-24 11:56:55,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:55,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517624620] [2024-10-24 11:56:55,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:55,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:56:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:56:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:56:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:56:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:56:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:56:55,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:55,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517624620] [2024-10-24 11:56:55,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517624620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:55,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:55,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:56:55,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388484222] [2024-10-24 11:56:55,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:55,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:56:55,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:55,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:56:55,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:56:55,962 INFO L87 Difference]: Start difference. First operand 84 states and 122 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:56:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:56,021 INFO L93 Difference]: Finished difference Result 169 states and 246 transitions. [2024-10-24 11:56:56,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:56:56,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-10-24 11:56:56,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:56,024 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:56:56,025 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:56:56,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-24 11:56:56,027 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 341 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-24 11:56:56,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 341 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:56:56,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:56:56,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 11:56:56,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 75 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:56:56,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2024-10-24 11:56:56,039 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 84 [2024-10-24 11:56:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:56,040 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2024-10-24 11:56:56,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:56:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2024-10-24 11:56:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:56:56,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:56,043 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:56:56,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:56:56,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:56,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:56,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1074062082, now seen corresponding path program 1 times [2024-10-24 11:56:56,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:56,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456841346] [2024-10-24 11:56:56,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:56,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:56:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:56:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:56:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:56:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:56:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:56:56,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:56,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456841346] [2024-10-24 11:56:56,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456841346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:56,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:56,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:56:56,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434865230] [2024-10-24 11:56:56,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:56,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:56:56,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:56,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:56:56,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:56:56,315 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:56:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:56,366 INFO L93 Difference]: Finished difference Result 174 states and 251 transitions. [2024-10-24 11:56:56,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:56:56,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-10-24 11:56:56,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:56,368 INFO L225 Difference]: With dead ends: 174 [2024-10-24 11:56:56,368 INFO L226 Difference]: Without dead ends: 89 [2024-10-24 11:56:56,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-24 11:56:56,371 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:56,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 341 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:56:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-24 11:56:56,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2024-10-24 11:56:56,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:56:56,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2024-10-24 11:56:56,384 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 84 [2024-10-24 11:56:56,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:56,387 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2024-10-24 11:56:56,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:56:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2024-10-24 11:56:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:56:56,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:56,390 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:56:56,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:56:56,390 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:56,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:56,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1074121664, now seen corresponding path program 1 times [2024-10-24 11:56:56,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:56,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349509474] [2024-10-24 11:56:56,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:56,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:56:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:56:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-24 11:56:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 11:56:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 11:56:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:56:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-24 11:56:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 11:56:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:56:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:56:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:56:56,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:56:56,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349509474] [2024-10-24 11:56:56,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349509474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:56:56,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:56:56,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:56:56,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772601661] [2024-10-24 11:56:56,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:56:56,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:56:56,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:56:56,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:56:56,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:56:56,711 INFO L87 Difference]: Start difference. First operand 88 states and 126 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:56:56,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:56:56,733 INFO L93 Difference]: Finished difference Result 175 states and 251 transitions. [2024-10-24 11:56:56,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:56:56,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-10-24 11:56:56,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:56:56,735 INFO L225 Difference]: With dead ends: 175 [2024-10-24 11:56:56,736 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 11:56:56,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:56:56,737 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:56:56,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:56:56,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 11:56:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-24 11:56:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:56:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 125 transitions. [2024-10-24 11:56:56,745 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 125 transitions. Word has length 84 [2024-10-24 11:56:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:56:56,745 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 125 transitions. [2024-10-24 11:56:56,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:56:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 125 transitions. [2024-10-24 11:56:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:56:56,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:56:56,747 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:56:56,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:56:56,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:56:56,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:56:56,748 INFO L85 PathProgramCache]: Analyzing trace with hash -614822078, now seen corresponding path program 1 times [2024-10-24 11:56:56,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:56:56,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691474445] [2024-10-24 11:56:56,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:56,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:56:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:56:56,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [70473173] [2024-10-24 11:56:56,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:56:56,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:56:56,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:56:56,917 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:56:56,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:56:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:56:57,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:56:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:56:57,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:56:57,560 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:56:57,562 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:56:57,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 11:56:57,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:56:57,772 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-24 11:56:57,891 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:56:57,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:56:57 BoogieIcfgContainer [2024-10-24 11:56:57,896 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:56:57,897 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:56:57,899 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:56:57,899 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:56:57,899 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:56:54" (3/4) ... [2024-10-24 11:56:57,901 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:56:57,902 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:56:57,902 INFO L158 Benchmark]: Toolchain (without parser) took 4541.72ms. Allocated memory was 115.3MB in the beginning and 199.2MB in the end (delta: 83.9MB). Free memory was 61.2MB in the beginning and 88.5MB in the end (delta: -27.3MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2024-10-24 11:56:57,903 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 115.3MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:56:57,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.54ms. Allocated memory was 115.3MB in the beginning and 161.5MB in the end (delta: 46.1MB). Free memory was 60.9MB in the beginning and 125.8MB in the end (delta: -64.9MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-10-24 11:56:57,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.31ms. Allocated memory is still 161.5MB. Free memory was 125.8MB in the beginning and 121.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:56:57,904 INFO L158 Benchmark]: Boogie Preprocessor took 102.10ms. Allocated memory is still 161.5MB. Free memory was 121.7MB in the beginning and 117.0MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:56:57,904 INFO L158 Benchmark]: RCFGBuilder took 901.33ms. Allocated memory is still 161.5MB. Free memory was 117.0MB in the beginning and 78.5MB in the end (delta: 38.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-10-24 11:56:57,905 INFO L158 Benchmark]: TraceAbstraction took 3010.84ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 77.6MB in the beginning and 88.5MB in the end (delta: -10.8MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2024-10-24 11:56:57,905 INFO L158 Benchmark]: Witness Printer took 4.86ms. Allocated memory is still 199.2MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:56:57,907 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.16ms. Allocated memory is still 115.3MB. Free memory is still 83.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.54ms. Allocated memory was 115.3MB in the beginning and 161.5MB in the end (delta: 46.1MB). Free memory was 60.9MB in the beginning and 125.8MB in the end (delta: -64.9MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.31ms. Allocated memory is still 161.5MB. Free memory was 125.8MB in the beginning and 121.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.10ms. Allocated memory is still 161.5MB. Free memory was 121.7MB in the beginning and 117.0MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 901.33ms. Allocated memory is still 161.5MB. Free memory was 117.0MB in the beginning and 78.5MB in the end (delta: 38.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3010.84ms. Allocated memory was 161.5MB in the beginning and 199.2MB in the end (delta: 37.7MB). Free memory was 77.6MB in the beginning and 88.5MB in the end (delta: -10.8MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * Witness Printer took 4.86ms. Allocated memory is still 199.2MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryArithmeticFLOAToperation at line 61. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L47] signed short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L48] signed short int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L49] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L50] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L51] float* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L52] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L53] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L54] unsigned long int* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L55] signed long int* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L56] float* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); [L57] unsigned char last_1_WrapperStruct00_var_1_15 = 64; [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L93] EXPR WrapperStruct00.var_1_15 [L93] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L103] RET updateLastVariables() [L104] CALL updateVariables() [L77] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L78] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L78] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L78] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L79] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L79] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L79] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L80] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L81] EXPR WrapperStruct00.var_1_13 [L81] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L81] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L81] EXPR WrapperStruct00.var_1_13 [L81] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L81] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L81] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L81] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L81] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L82] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L83] EXPR WrapperStruct00.var_1_14 [L83] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L83] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L83] EXPR WrapperStruct00.var_1_14 [L83] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L83] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L83] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L83] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L83] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L84] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L87] WrapperStruct00.var_1_19 = __VERIFIER_nondet_long() [L88] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= -2147483648) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L89] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L90] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_19 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_19 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L104] RET updateVariables() [L105] CALL step() [L61] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L61] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L61] (*(WrapperStruct00_var_1_12_Pointer)) = ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer))) [L62] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L62] COND TRUE (- last_1_WrapperStruct00_var_1_15) >= ((*(WrapperStruct00_var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4)))) [L63] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L63] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_16_Pointer)) [L65] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L65] (*(WrapperStruct00_var_1_20_Pointer)) = (*(WrapperStruct00_var_1_13_Pointer)) [L66] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L66] EXPR \read(*WrapperStruct00_var_1_20_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L66] COND TRUE (*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer)) [L67] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L67] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L67] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L67] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L67] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L67] (*(WrapperStruct00_var_1_1_Pointer)) = (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))) [L71] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L71] signed long int stepLocal_0 = (*(WrapperStruct00_var_1_15_Pointer)) + ((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))); [L72] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L72] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L72] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L72] COND FALSE !(stepLocal_0 != ((*(WrapperStruct00_var_1_15_Pointer)) * ((*(WrapperStruct00_var_1_1_Pointer)) / (*(WrapperStruct00_var_1_19_Pointer))))) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_20_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR ((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))))))) [L96] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L96] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L96] EXPR (((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR ((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR (((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR (((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer))))) [L96] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L96] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L96] EXPR (((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR ((((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer)))))) && (((- last_1_WrapperStruct00_var_1_15) >= ((*(WrapperStruct00_var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR ((((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer)))))) && (((- last_1_WrapperStruct00_var_1_15) >= ((*(WrapperStruct00_var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR (((((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer)))))) && (((- last_1_WrapperStruct00_var_1_15) >= ((*(WrapperStruct00_var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1)) && ((((*(WrapperStruct00_var_1_15_Pointer)) + ((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) != ((*(WrapperStruct00_var_1_15_Pointer)) * ((*(WrapperStruct00_var_1_1_Pointer)) / (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) ? (10u) : (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR (((((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer)))))) && (((- last_1_WrapperStruct00_var_1_15) >= ((*(WrapperStruct00_var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1)) && ((((*(WrapperStruct00_var_1_15_Pointer)) + ((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) != ((*(WrapperStruct00_var_1_15_Pointer)) * ((*(WrapperStruct00_var_1_1_Pointer)) / (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) ? (10u) : (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR ((((((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer)))))) && (((- last_1_WrapperStruct00_var_1_15) >= ((*(WrapperStruct00_var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1)) && ((((*(WrapperStruct00_var_1_15_Pointer)) + ((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) != ((*(WrapperStruct00_var_1_15_Pointer)) * ((*(WrapperStruct00_var_1_1_Pointer)) / (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) ? (10u) : (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96] EXPR ((((((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer)))))) && (((- last_1_WrapperStruct00_var_1_15) >= ((*(WrapperStruct00_var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1)) && ((((*(WrapperStruct00_var_1_15_Pointer)) + ((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) != ((*(WrapperStruct00_var_1_15_Pointer)) * ((*(WrapperStruct00_var_1_1_Pointer)) / (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) ? (10u) : (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L96-L97] return ((((((*(WrapperStruct00_var_1_20_Pointer)) > (*(WrapperStruct00_var_1_20_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) ((((((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) < (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) ? (((*(WrapperStruct00_var_1_15_Pointer)) - (((((*(WrapperStruct00_var_1_15_Pointer))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer))))))) : (((*(WrapperStruct00_var_1_15_Pointer)) + (((((*(WrapperStruct00_var_1_15_Pointer))) < ((*(WrapperStruct00_var_1_15_Pointer)))) ? ((*(WrapperStruct00_var_1_15_Pointer))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((0.85f - (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_14_Pointer)))))) && (((- last_1_WrapperStruct00_var_1_15) >= ((*(WrapperStruct00_var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1)) && ((((*(WrapperStruct00_var_1_15_Pointer)) + ((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)))) != ((*(WrapperStruct00_var_1_15_Pointer)) * ((*(WrapperStruct00_var_1_1_Pointer)) / (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) ? (10u) : (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer)))))) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:4}, WrapperStruct00_var_1_13_Pointer={4:8}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_19_Pointer={4:22}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:26}, WrapperStruct00_var_1_4_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 1029 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 563 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 466 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 332 ConstructedInterpolants, 0 QuantifiedInterpolants, 338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 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-24 11:56:57,950 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-26.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 3291167999bb7bd7f68091110884d1151ee296ff17c178c4f709963149d4b67b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:57:00,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:57:00,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:57:00,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:57:00,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:57:00,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:57:00,234 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:57:00,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:57:00,235 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:57:00,236 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:57:00,236 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:57:00,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:57:00,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:57:00,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:57:00,240 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:57:00,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:57:00,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:57:00,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:57:00,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:57:00,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:57:00,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:57:00,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:57:00,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:57:00,246 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:57:00,246 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:57:00,246 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:57:00,246 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:57:00,246 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:57:00,247 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:57:00,247 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:57:00,247 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:57:00,247 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:57:00,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:57:00,248 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:57:00,248 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:57:00,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:57:00,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:57:00,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:57:00,251 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:57:00,251 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:57:00,251 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:57:00,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:57:00,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:57:00,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:57:00,252 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:57:00,252 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 -> 3291167999bb7bd7f68091110884d1151ee296ff17c178c4f709963149d4b67b [2024-10-24 11:57:00,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:57:00,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:57:00,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:57:00,581 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:57:00,581 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:57:00,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i [2024-10-24 11:57:02,190 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:57:02,443 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:57:02,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-26.i [2024-10-24 11:57:02,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe7496776/d420b43a62b744aca3abc66fc28a431d/FLAGe7cf62d89 [2024-10-24 11:57:02,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe7496776/d420b43a62b744aca3abc66fc28a431d [2024-10-24 11:57:02,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:57:02,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:57:02,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:57:02,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:57:02,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:57:02,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:57:02" (1/1) ... [2024-10-24 11:57:02,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547bb253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:02, skipping insertion in model container [2024-10-24 11:57:02,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:57:02" (1/1) ... [2024-10-24 11:57:02,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:57:02,718 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-26.i[917,930] [2024-10-24 11:57:02,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:57:02,818 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:57:02,831 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-26.i[917,930] [2024-10-24 11:57:02,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:57:02,907 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:57:02,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:02 WrapperNode [2024-10-24 11:57:02,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:57:02,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:57:02,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:57:02,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:57:02,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:02" (1/1) ... [2024-10-24 11:57:02,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:02" (1/1) ... [2024-10-24 11:57:02,969 INFO L138 Inliner]: procedures = 36, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 480 [2024-10-24 11:57:02,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:57:02,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:57:02,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:57:02,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:57:02,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:02" (1/1) ... [2024-10-24 11:57:02,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:02" (1/1) ... [2024-10-24 11:57:02,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:02" (1/1) ... [2024-10-24 11:57:03,013 INFO L175 MemorySlicer]: Split 129 memory accesses to 2 slices as follows [2, 127]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 11 writes are split as follows [0, 11]. [2024-10-24 11:57:03,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:02" (1/1) ... [2024-10-24 11:57:03,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:02" (1/1) ... [2024-10-24 11:57:03,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:02" (1/1) ... [2024-10-24 11:57:03,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:02" (1/1) ... [2024-10-24 11:57:03,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:02" (1/1) ... [2024-10-24 11:57:03,049 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:02" (1/1) ... [2024-10-24 11:57:03,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:57:03,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:57:03,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:57:03,056 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:57:03,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:02" (1/1) ... [2024-10-24 11:57:03,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:57:03,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:57:03,096 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-24 11:57:03,100 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-24 11:57:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:57:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:57:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:57:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-24 11:57:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-24 11:57:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:57:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:57:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:57:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:57:03,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:57:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:57:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:57:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:57:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-24 11:57:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-24 11:57:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:57:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:57:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:57:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:57:03,138 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:57:03,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:57:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:57:03,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:57:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:57:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:57:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-24 11:57:03,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-24 11:57:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:57:03,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:57:03,262 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:57:03,265 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:57:04,535 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2024-10-24 11:57:04,536 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:57:04,570 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:57:04,571 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:57:04,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:57:04 BoogieIcfgContainer [2024-10-24 11:57:04,572 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:57:04,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:57:04,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:57:04,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:57:04,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:57:02" (1/3) ... [2024-10-24 11:57:04,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146c0cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:57:04, skipping insertion in model container [2024-10-24 11:57:04,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:57:02" (2/3) ... [2024-10-24 11:57:04,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146c0cfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:57:04, skipping insertion in model container [2024-10-24 11:57:04,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:57:04" (3/3) ... [2024-10-24 11:57:04,582 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-26.i [2024-10-24 11:57:04,605 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:57:04,606 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:57:04,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:57:04,678 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;@7a0e21ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:57:04,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:57:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:04,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:57:04,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:04,697 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:04,697 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:04,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:04,703 INFO L85 PathProgramCache]: Analyzing trace with hash -483601842, now seen corresponding path program 1 times [2024-10-24 11:57:04,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:04,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046152427] [2024-10-24 11:57:04,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:04,717 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-24 11:57:04,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:04,718 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-24 11:57:04,720 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-24 11:57:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:05,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:57:05,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-24 11:57:05,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:57:05,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:05,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046152427] [2024-10-24 11:57:05,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046152427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:05,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:05,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:57:05,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414969446] [2024-10-24 11:57:05,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:05,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:57:05,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:05,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:57:05,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:57:05,164 INFO L87 Difference]: Start difference. First operand has 86 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:57:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:05,396 INFO L93 Difference]: Finished difference Result 169 states and 261 transitions. [2024-10-24 11:57:05,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:57:05,399 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-10-24 11:57:05,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:05,414 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:57:05,414 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 11:57:05,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-24 11:57:05,421 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 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.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:05,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:57:05,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 11:57:05,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 11:57:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 122 transitions. [2024-10-24 11:57:05,461 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 122 transitions. Word has length 84 [2024-10-24 11:57:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:05,462 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 122 transitions. [2024-10-24 11:57:05,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:57:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 122 transitions. [2024-10-24 11:57:05,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:57:05,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:05,465 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:05,477 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-24 11:57:05,666 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-24 11:57:05,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:05,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:05,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1312447424, now seen corresponding path program 1 times [2024-10-24 11:57:05,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:05,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116153052] [2024-10-24 11:57:05,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:05,669 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-24 11:57:05,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:05,673 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-24 11:57:05,674 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-24 11:57:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:06,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:57:06,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-24 11:57:06,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:57:06,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:06,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116153052] [2024-10-24 11:57:06,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116153052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:06,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:06,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:57:06,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66728827] [2024-10-24 11:57:06,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:06,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:57:06,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:06,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:57:06,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:57:06,056 INFO L87 Difference]: Start difference. First operand 84 states and 122 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:57:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:06,329 INFO L93 Difference]: Finished difference Result 169 states and 246 transitions. [2024-10-24 11:57:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:57:06,333 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), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-10-24 11:57:06,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:06,335 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:57:06,335 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:57:06,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 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-24 11:57:06,338 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 341 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.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:06,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 341 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:57:06,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:57:06,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 11:57:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 75 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:06,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2024-10-24 11:57:06,351 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 84 [2024-10-24 11:57:06,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:06,352 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2024-10-24 11:57:06,352 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), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:57:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2024-10-24 11:57:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:57:06,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:06,354 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:06,365 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 (3)] Forceful destruction successful, exit code 0 [2024-10-24 11:57:06,555 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-24 11:57:06,556 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:06,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:06,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1074062082, now seen corresponding path program 1 times [2024-10-24 11:57:06,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:06,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054362054] [2024-10-24 11:57:06,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:06,558 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-24 11:57:06,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:06,561 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-24 11:57:06,562 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-24 11:57:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:07,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:57:07,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:07,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 11:57:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:07,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:57:07,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:07,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054362054] [2024-10-24 11:57:07,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054362054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:07,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:07,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:57:07,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841698395] [2024-10-24 11:57:07,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:07,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:57:07,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:07,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:57:07,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:07,104 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:07,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:07,553 INFO L93 Difference]: Finished difference Result 171 states and 247 transitions. [2024-10-24 11:57:07,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:57:07,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-10-24 11:57:07,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:07,557 INFO L225 Difference]: With dead ends: 171 [2024-10-24 11:57:07,557 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:57:07,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:07,559 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:07,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:57:07,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:57:07,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 11:57:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:07,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 123 transitions. [2024-10-24 11:57:07,571 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 123 transitions. Word has length 84 [2024-10-24 11:57:07,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:07,572 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 123 transitions. [2024-10-24 11:57:07,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:07,573 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 123 transitions. [2024-10-24 11:57:07,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:57:07,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:07,574 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:07,588 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-24 11:57:07,775 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-24 11:57:07,775 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:07,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:07,776 INFO L85 PathProgramCache]: Analyzing trace with hash -614881660, now seen corresponding path program 1 times [2024-10-24 11:57:07,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:07,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436546295] [2024-10-24 11:57:07,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:07,777 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-24 11:57:07,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:07,781 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-24 11:57:07,782 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-24 11:57:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:08,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 11:57:08,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:08,163 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:57:08,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:08,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436546295] [2024-10-24 11:57:08,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436546295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:08,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:08,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:57:08,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355416349] [2024-10-24 11:57:08,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:08,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:57:08,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:08,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:57:08,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:57:08,168 INFO L87 Difference]: Start difference. First operand 86 states and 123 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:08,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:08,546 INFO L93 Difference]: Finished difference Result 176 states and 252 transitions. [2024-10-24 11:57:08,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:57:08,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2024-10-24 11:57:08,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:08,550 INFO L225 Difference]: With dead ends: 176 [2024-10-24 11:57:08,550 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 11:57:08,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-24 11:57:08,553 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:08,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 442 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:57:08,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 11:57:08,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-24 11:57:08,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2024-10-24 11:57:08,571 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 84 [2024-10-24 11:57:08,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:08,572 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2024-10-24 11:57:08,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:08,572 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2024-10-24 11:57:08,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-24 11:57:08,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:08,574 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:08,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 11:57:08,774 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-24 11:57:08,775 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:08,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:08,775 INFO L85 PathProgramCache]: Analyzing trace with hash -614822078, now seen corresponding path program 1 times [2024-10-24 11:57:08,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:08,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878904214] [2024-10-24 11:57:08,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:08,776 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-24 11:57:08,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:08,779 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-24 11:57:08,780 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-24 11:57:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:09,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:57:09,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:09,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-10-24 11:57:09,243 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-10-24 11:57:09,243 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:57:09,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:09,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878904214] [2024-10-24 11:57:09,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878904214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:09,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:09,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:57:09,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856449305] [2024-10-24 11:57:09,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:09,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:57:09,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:09,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:57:09,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:57:09,246 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:57:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:10,326 INFO L93 Difference]: Finished difference Result 179 states and 253 transitions. [2024-10-24 11:57:10,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:57:10,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2024-10-24 11:57:10,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:10,327 INFO L225 Difference]: With dead ends: 179 [2024-10-24 11:57:10,327 INFO L226 Difference]: Without dead ends: 90 [2024-10-24 11:57:10,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:57:10,329 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 111 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:10,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 352 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 11:57:10,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-24 11:57:10,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2024-10-24 11:57:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2024-10-24 11:57:10,337 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 84 [2024-10-24 11:57:10,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:10,337 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2024-10-24 11:57:10,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 11:57:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2024-10-24 11:57:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 11:57:10,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:10,339 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:10,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-24 11:57:10,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 11:57:10,540 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:10,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:10,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1443067654, now seen corresponding path program 1 times [2024-10-24 11:57:10,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:10,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867203172] [2024-10-24 11:57:10,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:10,542 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-24 11:57:10,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:10,545 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 11:57:10,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 11:57:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:10,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 11:57:10,852 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:10,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 40 [2024-10-24 11:57:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-24 11:57:11,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:57:11,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 22 [2024-10-24 11:57:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-24 11:57:11,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:11,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [867203172] [2024-10-24 11:57:11,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [867203172] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 11:57:11,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 11:57:11,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-24 11:57:11,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643313477] [2024-10-24 11:57:11,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 11:57:11,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 11:57:11,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:11,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 11:57:11,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 11:57:11,262 INFO L87 Difference]: Start difference. First operand 88 states and 124 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-24 11:57:12,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:12,465 INFO L93 Difference]: Finished difference Result 188 states and 262 transitions. [2024-10-24 11:57:12,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:57:12,466 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 86 [2024-10-24 11:57:12,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:12,467 INFO L225 Difference]: With dead ends: 188 [2024-10-24 11:57:12,467 INFO L226 Difference]: Without dead ends: 90 [2024-10-24 11:57:12,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:57:12,469 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 124 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:12,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 582 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 11:57:12,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-24 11:57:12,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2024-10-24 11:57:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:12,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2024-10-24 11:57:12,479 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 86 [2024-10-24 11:57:12,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:12,480 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2024-10-24 11:57:12,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-24 11:57:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2024-10-24 11:57:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 11:57:12,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:12,481 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:12,498 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 (7)] Ended with exit code 0 [2024-10-24 11:57:12,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-24 11:57:12,683 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:12,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:12,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1519968452, now seen corresponding path program 1 times [2024-10-24 11:57:12,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:12,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186898416] [2024-10-24 11:57:12,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:12,684 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-24 11:57:12,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:12,686 INFO L229 MonitoredProcess]: Starting monitored process 8 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-24 11:57:12,686 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 (8)] Waiting until timeout for monitored process [2024-10-24 11:57:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:57:13,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:13,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-10-24 11:57:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:13,073 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:57:13,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:13,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186898416] [2024-10-24 11:57:13,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186898416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:13,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:13,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:57:13,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918456974] [2024-10-24 11:57:13,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:13,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:57:13,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:13,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:57:13,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:13,076 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:13,345 INFO L93 Difference]: Finished difference Result 173 states and 241 transitions. [2024-10-24 11:57:13,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:57:13,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2024-10-24 11:57:13,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:13,348 INFO L225 Difference]: With dead ends: 173 [2024-10-24 11:57:13,348 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:57:13,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:13,353 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:13,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:57:13,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:57:13,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 11:57:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:13,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 119 transitions. [2024-10-24 11:57:13,360 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 119 transitions. Word has length 86 [2024-10-24 11:57:13,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:13,361 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 119 transitions. [2024-10-24 11:57:13,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:13,361 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 119 transitions. [2024-10-24 11:57:13,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 11:57:13,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:13,362 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:13,375 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 (8)] Ended with exit code 0 [2024-10-24 11:57:13,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-24 11:57:13,563 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:13,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:13,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1689389851, now seen corresponding path program 1 times [2024-10-24 11:57:13,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:13,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663940239] [2024-10-24 11:57:13,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:13,565 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-24 11:57:13,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:13,566 INFO L229 MonitoredProcess]: Starting monitored process 9 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-24 11:57:13,568 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 (9)] Waiting until timeout for monitored process [2024-10-24 11:57:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:13,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:57:13,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:13,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 11:57:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:13,985 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:57:13,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:13,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663940239] [2024-10-24 11:57:13,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663940239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:13,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:13,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:57:13,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951430202] [2024-10-24 11:57:13,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:13,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:57:13,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:13,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:57:13,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:13,988 INFO L87 Difference]: Start difference. First operand 86 states and 119 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:14,296 INFO L93 Difference]: Finished difference Result 171 states and 237 transitions. [2024-10-24 11:57:14,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:57:14,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-24 11:57:14,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:14,297 INFO L225 Difference]: With dead ends: 171 [2024-10-24 11:57:14,297 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:57:14,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:14,298 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:14,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:57:14,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:57:14,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 11:57:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 states have internal predecessors, (100), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2024-10-24 11:57:14,306 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 91 [2024-10-24 11:57:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:14,306 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2024-10-24 11:57:14,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2024-10-24 11:57:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 11:57:14,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:14,308 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:14,318 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 (9)] Forceful destruction successful, exit code 0 [2024-10-24 11:57:14,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-24 11:57:14,509 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:14,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:14,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1823403357, now seen corresponding path program 1 times [2024-10-24 11:57:14,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:14,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444663631] [2024-10-24 11:57:14,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:14,510 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-24 11:57:14,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:14,513 INFO L229 MonitoredProcess]: Starting monitored process 10 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-24 11:57:14,514 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 (10)] Waiting until timeout for monitored process [2024-10-24 11:57:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:14,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:57:14,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:14,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 11:57:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:14,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:57:14,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:14,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444663631] [2024-10-24 11:57:14,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444663631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:14,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:14,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:57:14,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788088941] [2024-10-24 11:57:14,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:14,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:57:14,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:14,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:57:14,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:14,934 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:15,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:15,392 INFO L93 Difference]: Finished difference Result 171 states and 235 transitions. [2024-10-24 11:57:15,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:57:15,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-24 11:57:15,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:15,394 INFO L225 Difference]: With dead ends: 171 [2024-10-24 11:57:15,394 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:57:15,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:15,395 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:15,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 11:57:15,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:57:15,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 11:57:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.32) internal successors, (99), 75 states have internal predecessors, (99), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:15,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 117 transitions. [2024-10-24 11:57:15,401 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 117 transitions. Word has length 91 [2024-10-24 11:57:15,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:15,402 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 117 transitions. [2024-10-24 11:57:15,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:15,402 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 117 transitions. [2024-10-24 11:57:15,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 11:57:15,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:15,403 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:15,416 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 (10)] Ended with exit code 0 [2024-10-24 11:57:15,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-24 11:57:15,604 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:15,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:15,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1604548639, now seen corresponding path program 1 times [2024-10-24 11:57:15,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:15,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341977886] [2024-10-24 11:57:15,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:15,605 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-24 11:57:15,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:15,607 INFO L229 MonitoredProcess]: Starting monitored process 11 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-24 11:57:15,608 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 (11)] Waiting until timeout for monitored process [2024-10-24 11:57:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:15,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:57:15,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:15,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 11:57:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:16,024 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:57:16,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:16,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341977886] [2024-10-24 11:57:16,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341977886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:16,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:16,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:57:16,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164642256] [2024-10-24 11:57:16,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:16,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:57:16,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:16,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:57:16,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:16,030 INFO L87 Difference]: Start difference. First operand 86 states and 117 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:16,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:16,426 INFO L93 Difference]: Finished difference Result 171 states and 233 transitions. [2024-10-24 11:57:16,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:57:16,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-24 11:57:16,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:16,428 INFO L225 Difference]: With dead ends: 171 [2024-10-24 11:57:16,428 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:57:16,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:16,429 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:16,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:57:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:57:16,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 11:57:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.3066666666666666) internal successors, (98), 75 states have internal predecessors, (98), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 116 transitions. [2024-10-24 11:57:16,434 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 116 transitions. Word has length 91 [2024-10-24 11:57:16,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:16,435 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 116 transitions. [2024-10-24 11:57:16,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:16,435 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 116 transitions. [2024-10-24 11:57:16,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-24 11:57:16,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:16,436 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:16,452 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 (11)] Ended with exit code 0 [2024-10-24 11:57:16,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-24 11:57:16,637 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:16,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:16,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1872770207, now seen corresponding path program 1 times [2024-10-24 11:57:16,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:16,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52005331] [2024-10-24 11:57:16,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:16,638 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-24 11:57:16,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:16,640 INFO L229 MonitoredProcess]: Starting monitored process 12 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-24 11:57:16,641 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 (12)] Waiting until timeout for monitored process [2024-10-24 11:57:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:16,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:57:16,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:17,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2024-10-24 11:57:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:17,029 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:57:17,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:17,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52005331] [2024-10-24 11:57:17,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52005331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:17,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:17,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:57:17,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137103185] [2024-10-24 11:57:17,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:17,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:57:17,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:17,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:57:17,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:17,031 INFO L87 Difference]: Start difference. First operand 86 states and 116 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:17,479 INFO L93 Difference]: Finished difference Result 169 states and 228 transitions. [2024-10-24 11:57:17,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:57:17,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2024-10-24 11:57:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:17,480 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:57:17,480 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 11:57:17,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:17,481 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:17,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 11:57:17,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 11:57:17,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 11:57:17,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 73 states have internal predecessors, (94), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:17,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 112 transitions. [2024-10-24 11:57:17,487 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 112 transitions. Word has length 91 [2024-10-24 11:57:17,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:17,488 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 112 transitions. [2024-10-24 11:57:17,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:17,488 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 112 transitions. [2024-10-24 11:57:17,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:57:17,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:17,489 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:17,504 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 (12)] Forceful destruction successful, exit code 0 [2024-10-24 11:57:17,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-24 11:57:17,690 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:17,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:17,691 INFO L85 PathProgramCache]: Analyzing trace with hash 631138596, now seen corresponding path program 1 times [2024-10-24 11:57:17,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:17,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819316312] [2024-10-24 11:57:17,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:17,691 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-24 11:57:17,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:17,693 INFO L229 MonitoredProcess]: Starting monitored process 13 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-24 11:57:17,694 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 (13)] Waiting until timeout for monitored process [2024-10-24 11:57:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:18,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:57:18,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:18,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 11:57:18,141 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:18,141 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:57:18,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:18,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819316312] [2024-10-24 11:57:18,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819316312] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:18,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:18,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:57:18,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082996874] [2024-10-24 11:57:18,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:18,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:57:18,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:18,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:57:18,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:18,143 INFO L87 Difference]: Start difference. First operand 84 states and 112 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:18,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:18,399 INFO L93 Difference]: Finished difference Result 167 states and 223 transitions. [2024-10-24 11:57:18,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:57:18,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-24 11:57:18,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:18,401 INFO L225 Difference]: With dead ends: 167 [2024-10-24 11:57:18,401 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 11:57:18,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:18,402 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:18,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:57:18,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 11:57:18,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 11:57:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.273972602739726) internal successors, (93), 73 states have internal predecessors, (93), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 111 transitions. [2024-10-24 11:57:18,406 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 111 transitions. Word has length 96 [2024-10-24 11:57:18,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:18,407 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 111 transitions. [2024-10-24 11:57:18,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:18,407 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 111 transitions. [2024-10-24 11:57:18,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:57:18,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:18,408 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:18,422 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 (13)] Forceful destruction successful, exit code 0 [2024-10-24 11:57:18,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-24 11:57:18,609 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:18,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:18,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1363006110, now seen corresponding path program 1 times [2024-10-24 11:57:18,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:18,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289610795] [2024-10-24 11:57:18,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:18,610 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-24 11:57:18,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:18,611 INFO L229 MonitoredProcess]: Starting monitored process 14 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-24 11:57:18,612 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 (14)] Waiting until timeout for monitored process [2024-10-24 11:57:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:19,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:57:19,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:19,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 11:57:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:19,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:57:19,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:19,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289610795] [2024-10-24 11:57:19,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289610795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:19,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:19,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:57:19,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599319499] [2024-10-24 11:57:19,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:19,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:57:19,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:19,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:57:19,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:19,065 INFO L87 Difference]: Start difference. First operand 84 states and 111 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:19,350 INFO L93 Difference]: Finished difference Result 167 states and 221 transitions. [2024-10-24 11:57:19,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:57:19,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-24 11:57:19,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:19,351 INFO L225 Difference]: With dead ends: 167 [2024-10-24 11:57:19,351 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 11:57:19,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:19,352 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:19,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:57:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 11:57:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 11:57:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 73 states have internal predecessors, (92), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:19,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2024-10-24 11:57:19,357 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 96 [2024-10-24 11:57:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:19,357 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2024-10-24 11:57:19,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2024-10-24 11:57:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:57:19,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:19,358 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:19,372 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 (14)] Forceful destruction successful, exit code 0 [2024-10-24 11:57:19,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-24 11:57:19,559 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:19,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:19,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1920843936, now seen corresponding path program 1 times [2024-10-24 11:57:19,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:19,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442524244] [2024-10-24 11:57:19,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:19,560 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-24 11:57:19,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:19,561 INFO L229 MonitoredProcess]: Starting monitored process 15 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-24 11:57:19,562 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 (15)] Waiting until timeout for monitored process [2024-10-24 11:57:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:20,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-10-24 11:57:20,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:24,138 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-24 11:57:24,237 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-10-24 11:57:24,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 36 [2024-10-24 11:57:24,340 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 33 treesize of output 24 [2024-10-24 11:57:25,241 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 72 treesize of output 54 [2024-10-24 11:57:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 11:57:25,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 11:57:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:28,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:28,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442524244] [2024-10-24 11:57:28,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442524244] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 11:57:28,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 11:57:28,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19] total 31 [2024-10-24 11:57:28,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422161400] [2024-10-24 11:57:28,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:28,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:57:28,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:28,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:57:28,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2024-10-24 11:57:28,091 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:33,491 INFO L93 Difference]: Finished difference Result 207 states and 270 transitions. [2024-10-24 11:57:33,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 11:57:33,497 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-24 11:57:33,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:33,498 INFO L225 Difference]: With dead ends: 207 [2024-10-24 11:57:33,498 INFO L226 Difference]: Without dead ends: 124 [2024-10-24 11:57:33,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=167, Invalid=1393, Unknown=0, NotChecked=0, Total=1560 [2024-10-24 11:57:33,500 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 62 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:33,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 722 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-24 11:57:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-24 11:57:33,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 95. [2024-10-24 11:57:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.25) internal successors, (105), 84 states have internal predecessors, (105), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2024-10-24 11:57:33,505 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 96 [2024-10-24 11:57:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:33,506 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2024-10-24 11:57:33,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2024-10-24 11:57:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:57:33,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:33,508 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:33,526 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 (15)] Forceful destruction successful, exit code 0 [2024-10-24 11:57:33,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-24 11:57:33,709 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:33,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:33,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1527816926, now seen corresponding path program 1 times [2024-10-24 11:57:33,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:33,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408585530] [2024-10-24 11:57:33,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:33,710 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-24 11:57:33,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:33,712 INFO L229 MonitoredProcess]: Starting monitored process 16 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-24 11:57:33,713 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 (16)] Waiting until timeout for monitored process [2024-10-24 11:57:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:34,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 11:57:34,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:34,162 INFO L349 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2024-10-24 11:57:34,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2024-10-24 11:57:34,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:57:34,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 38 [2024-10-24 11:57:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:34,658 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:57:34,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:34,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408585530] [2024-10-24 11:57:34,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408585530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:34,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:34,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 11:57:34,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429035827] [2024-10-24 11:57:34,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:34,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 11:57:34,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:34,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 11:57:34,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-24 11:57:34,660 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:37,014 INFO L93 Difference]: Finished difference Result 232 states and 300 transitions. [2024-10-24 11:57:37,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 11:57:37,015 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-24 11:57:37,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:37,016 INFO L225 Difference]: With dead ends: 232 [2024-10-24 11:57:37,016 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 11:57:37,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-10-24 11:57:37,017 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 51 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:37,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 697 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 11:57:37,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 11:57:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 104. [2024-10-24 11:57:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 93 states have (on average 1.2473118279569892) internal successors, (116), 93 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 134 transitions. [2024-10-24 11:57:37,023 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 134 transitions. Word has length 96 [2024-10-24 11:57:37,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:37,023 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 134 transitions. [2024-10-24 11:57:37,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2024-10-24 11:57:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:57:37,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:37,024 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:37,038 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 (16)] Forceful destruction successful, exit code 0 [2024-10-24 11:57:37,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-24 11:57:37,225 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:37,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:37,226 INFO L85 PathProgramCache]: Analyzing trace with hash 719338187, now seen corresponding path program 1 times [2024-10-24 11:57:37,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:37,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8437854] [2024-10-24 11:57:37,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:37,226 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-24 11:57:37,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:37,228 INFO L229 MonitoredProcess]: Starting monitored process 17 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-24 11:57:37,228 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 (17)] Waiting until timeout for monitored process [2024-10-24 11:57:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:37,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-24 11:57:37,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:37,820 INFO L349 Elim1Store]: treesize reduction 26, result has 36.6 percent of original size [2024-10-24 11:57:37,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2024-10-24 11:57:38,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:57:38,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 84 [2024-10-24 11:57:38,579 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:38,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:57:38,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:38,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8437854] [2024-10-24 11:57:38,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8437854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:38,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:38,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-24 11:57:38,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983496140] [2024-10-24 11:57:38,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:38,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 11:57:38,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:38,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 11:57:38,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:57:38,581 INFO L87 Difference]: Start difference. First operand 104 states and 134 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:43,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:57:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:46,212 INFO L93 Difference]: Finished difference Result 242 states and 312 transitions. [2024-10-24 11:57:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 11:57:46,212 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-24 11:57:46,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:46,213 INFO L225 Difference]: With dead ends: 242 [2024-10-24 11:57:46,213 INFO L226 Difference]: Without dead ends: 139 [2024-10-24 11:57:46,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:57:46,214 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 51 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:46,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 740 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 641 Invalid, 1 Unknown, 0 Unchecked, 6.9s Time] [2024-10-24 11:57:46,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-24 11:57:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 106. [2024-10-24 11:57:46,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 137 transitions. [2024-10-24 11:57:46,220 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 137 transitions. Word has length 96 [2024-10-24 11:57:46,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:46,220 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 137 transitions. [2024-10-24 11:57:46,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:46,220 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 137 transitions. [2024-10-24 11:57:46,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:57:46,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:46,221 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:46,235 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 (17)] Forceful destruction successful, exit code 0 [2024-10-24 11:57:46,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-24 11:57:46,422 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:46,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:46,422 INFO L85 PathProgramCache]: Analyzing trace with hash 326311177, now seen corresponding path program 1 times [2024-10-24 11:57:46,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:46,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958256155] [2024-10-24 11:57:46,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:46,423 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-24 11:57:46,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:46,424 INFO L229 MonitoredProcess]: Starting monitored process 18 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-24 11:57:46,425 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 (18)] Waiting until timeout for monitored process [2024-10-24 11:57:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:46,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:57:46,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:46,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 11:57:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:46,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:57:46,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:46,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958256155] [2024-10-24 11:57:46,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958256155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:46,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:46,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:57:46,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722541679] [2024-10-24 11:57:46,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:46,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:57:46,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:46,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:57:46,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:46,858 INFO L87 Difference]: Start difference. First operand 106 states and 137 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:47,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:47,100 INFO L93 Difference]: Finished difference Result 210 states and 272 transitions. [2024-10-24 11:57:47,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:57:47,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-24 11:57:47,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:47,101 INFO L225 Difference]: With dead ends: 210 [2024-10-24 11:57:47,101 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 11:57:47,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:47,102 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:47,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:57:47,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 11:57:47,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2024-10-24 11:57:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 93 states have internal predecessors, (115), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:47,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 133 transitions. [2024-10-24 11:57:47,107 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 133 transitions. Word has length 96 [2024-10-24 11:57:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:47,107 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 133 transitions. [2024-10-24 11:57:47,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 133 transitions. [2024-10-24 11:57:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:57:47,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:47,108 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:47,121 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 (18)] Forceful destruction successful, exit code 0 [2024-10-24 11:57:47,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-24 11:57:47,309 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:47,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:47,310 INFO L85 PathProgramCache]: Analyzing trace with hash -291779063, now seen corresponding path program 1 times [2024-10-24 11:57:47,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:47,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047314756] [2024-10-24 11:57:47,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:47,310 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-24 11:57:47,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:47,313 INFO L229 MonitoredProcess]: Starting monitored process 19 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-24 11:57:47,314 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 (19)] Waiting until timeout for monitored process [2024-10-24 11:57:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:48,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-24 11:57:48,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:48,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 11:57:49,024 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 55 treesize of output 38 [2024-10-24 11:57:49,368 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:49,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:57:49,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:49,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047314756] [2024-10-24 11:57:49,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047314756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:49,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:49,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 11:57:49,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334286783] [2024-10-24 11:57:49,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:49,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 11:57:49,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:49,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 11:57:49,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:57:49,371 INFO L87 Difference]: Start difference. First operand 104 states and 133 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:51,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:51,070 INFO L93 Difference]: Finished difference Result 209 states and 268 transitions. [2024-10-24 11:57:51,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 11:57:51,071 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-24 11:57:51,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:51,073 INFO L225 Difference]: With dead ends: 209 [2024-10-24 11:57:51,073 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 11:57:51,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2024-10-24 11:57:51,074 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 87 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:51,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 270 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 11:57:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 11:57:51,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-10-24 11:57:51,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 87 states have internal predecessors, (107), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:51,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 125 transitions. [2024-10-24 11:57:51,079 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 125 transitions. Word has length 96 [2024-10-24 11:57:51,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:51,079 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 125 transitions. [2024-10-24 11:57:51,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:51,080 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 125 transitions. [2024-10-24 11:57:51,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:57:51,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:51,080 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:51,095 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 (19)] Ended with exit code 0 [2024-10-24 11:57:51,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-24 11:57:51,281 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:51,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:51,281 INFO L85 PathProgramCache]: Analyzing trace with hash -451629101, now seen corresponding path program 1 times [2024-10-24 11:57:51,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:51,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202644331] [2024-10-24 11:57:51,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:51,282 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-24 11:57:51,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:51,283 INFO L229 MonitoredProcess]: Starting monitored process 20 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-24 11:57:51,284 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 (20)] Waiting until timeout for monitored process [2024-10-24 11:57:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:51,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:57:51,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:51,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-24 11:57:51,656 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:51,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:57:51,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:51,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202644331] [2024-10-24 11:57:51,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202644331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:51,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:51,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 11:57:51,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760747427] [2024-10-24 11:57:51,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:51,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 11:57:51,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:51,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 11:57:51,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:51,658 INFO L87 Difference]: Start difference. First operand 98 states and 125 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:51,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:51,988 INFO L93 Difference]: Finished difference Result 195 states and 249 transitions. [2024-10-24 11:57:51,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 11:57:51,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-24 11:57:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:51,989 INFO L225 Difference]: With dead ends: 195 [2024-10-24 11:57:51,989 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 11:57:51,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 11:57:51,990 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:51,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 11:57:51,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 11:57:51,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-24 11:57:51,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 87 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 124 transitions. [2024-10-24 11:57:51,997 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 124 transitions. Word has length 96 [2024-10-24 11:57:51,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:51,997 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 124 transitions. [2024-10-24 11:57:51,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:51,998 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 124 transitions. [2024-10-24 11:57:51,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:57:51,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:51,998 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:52,010 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 (20)] Forceful destruction successful, exit code 0 [2024-10-24 11:57:52,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-24 11:57:52,199 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:52,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:52,199 INFO L85 PathProgramCache]: Analyzing trace with hash -311080491, now seen corresponding path program 1 times [2024-10-24 11:57:52,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:52,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291478796] [2024-10-24 11:57:52,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:52,200 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-24 11:57:52,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:52,201 INFO L229 MonitoredProcess]: Starting monitored process 21 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-24 11:57:52,202 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 (21)] Waiting until timeout for monitored process [2024-10-24 11:57:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:57:52,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-24 11:57:52,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:57:52,775 INFO L349 Elim1Store]: treesize reduction 23, result has 39.5 percent of original size [2024-10-24 11:57:52,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2024-10-24 11:57:53,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:57:53,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 50 [2024-10-24 11:57:53,252 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 11:57:53,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:57:53,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:57:53,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291478796] [2024-10-24 11:57:53,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291478796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:57:53,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:57:53,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-24 11:57:53,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528685519] [2024-10-24 11:57:53,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:57:53,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 11:57:53,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:57:53,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 11:57:53,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-10-24 11:57:53,254 INFO L87 Difference]: Start difference. First operand 98 states and 124 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:55,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:57:55,443 INFO L93 Difference]: Finished difference Result 224 states and 284 transitions. [2024-10-24 11:57:55,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 11:57:55,444 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2024-10-24 11:57:55,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:57:55,446 INFO L225 Difference]: With dead ends: 224 [2024-10-24 11:57:55,446 INFO L226 Difference]: Without dead ends: 122 [2024-10-24 11:57:55,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2024-10-24 11:57:55,447 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 50 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:57:55,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 714 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 11:57:55,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-24 11:57:55,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2024-10-24 11:57:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.2195121951219512) internal successors, (100), 82 states have internal predecessors, (100), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 11:57:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2024-10-24 11:57:55,452 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 96 [2024-10-24 11:57:55,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:57:55,453 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2024-10-24 11:57:55,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 16 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 11:57:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2024-10-24 11:57:55,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 11:57:55,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:57:55,454 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 11:57:55,467 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 (21)] Ended with exit code 0 [2024-10-24 11:57:55,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-24 11:57:55,655 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:57:55,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:57:55,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2130676480, now seen corresponding path program 1 times [2024-10-24 11:57:55,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:57:55,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899651220] [2024-10-24 11:57:55,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:57:55,657 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-24 11:57:55,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:57:55,660 INFO L229 MonitoredProcess]: Starting monitored process 22 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-24 11:57:55,661 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 (22)] Waiting until timeout for monitored process