./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-s_file-78.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-s_file-78.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 cc60dbcb40c1b152bb26088ff001d223dce864841f907f99b254c3b58eb0aa47 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:52:11,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:52:12,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:52:12,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:52:12,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:52:12,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:52:12,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:52:12,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:52:12,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:52:12,074 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:52:12,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:52:12,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:52:12,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:52:12,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:52:12,076 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:52:12,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:52:12,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:52:12,079 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:52:12,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:52:12,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:52:12,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:52:12,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:52:12,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:52:12,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:52:12,081 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:52:12,081 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:52:12,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:52:12,082 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:52:12,082 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:52:12,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:52:12,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:52:12,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:52:12,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:52:12,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:52:12,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:52:12,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:52:12,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:52:12,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:52:12,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:52:12,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:52:12,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:52:12,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:52:12,086 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 -> cc60dbcb40c1b152bb26088ff001d223dce864841f907f99b254c3b58eb0aa47 [2024-10-24 11:52:12,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:52:12,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:52:12,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:52:12,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:52:12,357 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:52:12,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-78.i [2024-10-24 11:52:13,665 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:52:13,856 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:52:13,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-78.i [2024-10-24 11:52:13,865 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d59023ecf/acbe43ae89974c9dae60a424743d8c78/FLAGe0d94a4c4 [2024-10-24 11:52:14,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d59023ecf/acbe43ae89974c9dae60a424743d8c78 [2024-10-24 11:52:14,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:52:14,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:52:14,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:52:14,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:52:14,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:52:14,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:52:14" (1/1) ... [2024-10-24 11:52:14,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a1cbee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:14, skipping insertion in model container [2024-10-24 11:52:14,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:52:14" (1/1) ... [2024-10-24 11:52:14,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:52:14,415 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-s_file-78.i[916,929] [2024-10-24 11:52:14,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:52:14,470 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:52:14,480 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-s_file-78.i[916,929] [2024-10-24 11:52:14,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:52:14,579 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:52:14,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:14 WrapperNode [2024-10-24 11:52:14,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:52:14,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:52:14,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:52:14,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:52:14,591 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:52:14" (1/1) ... [2024-10-24 11:52:14,607 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:52:14" (1/1) ... [2024-10-24 11:52:14,643 INFO L138 Inliner]: procedures = 29, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 411 [2024-10-24 11:52:14,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:52:14,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:52:14,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:52:14,645 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:52:14,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:14" (1/1) ... [2024-10-24 11:52:14,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:14" (1/1) ... [2024-10-24 11:52:14,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:14" (1/1) ... [2024-10-24 11:52:14,687 INFO L175 MemorySlicer]: Split 110 memory accesses to 2 slices as follows [2, 108]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 15 writes are split as follows [0, 15]. [2024-10-24 11:52:14,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:14" (1/1) ... [2024-10-24 11:52:14,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:14" (1/1) ... [2024-10-24 11:52:14,711 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:14" (1/1) ... [2024-10-24 11:52:14,716 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:14" (1/1) ... [2024-10-24 11:52:14,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:14" (1/1) ... [2024-10-24 11:52:14,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:14" (1/1) ... [2024-10-24 11:52:14,723 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:52:14,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:52:14,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:52:14,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:52:14,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:14" (1/1) ... [2024-10-24 11:52:14,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:52:14,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:52:14,781 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:52:14,785 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:52:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:52:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-24 11:52:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-24 11:52:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-24 11:52:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-24 11:52:14,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-24 11:52:14,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-24 11:52:14,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 11:52:14,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 11:52:14,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-24 11:52:14,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-24 11:52:14,829 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:52:14,830 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:52:14,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:52:14,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 11:52:14,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:52:14,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:52:14,920 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:52:14,921 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:52:15,356 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2024-10-24 11:52:15,358 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:52:15,395 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:52:15,397 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:52:15,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:15 BoogieIcfgContainer [2024-10-24 11:52:15,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:52:15,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:52:15,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:52:15,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:52:15,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:52:14" (1/3) ... [2024-10-24 11:52:15,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f91363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:52:15, skipping insertion in model container [2024-10-24 11:52:15,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:14" (2/3) ... [2024-10-24 11:52:15,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f91363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:52:15, skipping insertion in model container [2024-10-24 11:52:15,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:15" (3/3) ... [2024-10-24 11:52:15,407 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-78.i [2024-10-24 11:52:15,422 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:52:15,422 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:52:15,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:52:15,483 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;@39e13a03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:52:15,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:52:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 74 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:52:15,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:52:15,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:15,498 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:15,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:15,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:15,503 INFO L85 PathProgramCache]: Analyzing trace with hash 315096233, now seen corresponding path program 1 times [2024-10-24 11:52:15,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:15,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777529159] [2024-10-24 11:52:15,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:15,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:15,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:15,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:52:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:15,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:52:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:15,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:52:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:15,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:52:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:15,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:52:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:15,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:52:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:15,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:52:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:15,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:52:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:15,782 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 11:52:15,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:15,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777529159] [2024-10-24 11:52:15,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777529159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:15,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:15,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:52:15,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994729032] [2024-10-24 11:52:15,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:15,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:52:15,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:15,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:52:15,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:52:15,826 INFO L87 Difference]: Start difference. First operand has 86 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 74 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:52:15,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:15,857 INFO L93 Difference]: Finished difference Result 169 states and 266 transitions. [2024-10-24 11:52:15,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:52:15,864 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, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2024-10-24 11:52:15,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:15,871 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:52:15,872 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 11:52:15,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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:52:15,880 INFO L432 NwaCegarLoop]: 120 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, 120 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:52:15,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:52:15,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 11:52:15,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 11:52:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 72 states have internal predecessors, (104), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:52:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2024-10-24 11:52:15,978 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 93 [2024-10-24 11:52:15,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:15,979 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2024-10-24 11:52:15,980 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, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:52:15,981 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2024-10-24 11:52:15,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:52:15,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:15,985 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:15,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:52:15,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:15,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:15,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2034445749, now seen corresponding path program 1 times [2024-10-24 11:52:15,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:15,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974157309] [2024-10-24 11:52:15,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:15,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:52:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:52:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:52:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:52:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:52:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:52:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:52:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:52:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 11:52:16,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:16,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974157309] [2024-10-24 11:52:16,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974157309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:16,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:16,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:52:16,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385848054] [2024-10-24 11:52:16,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:16,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:52:16,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:16,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:52:16,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:52:16,263 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:52:16,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:16,311 INFO L93 Difference]: Finished difference Result 169 states and 250 transitions. [2024-10-24 11:52:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:52:16,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2024-10-24 11:52:16,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:16,315 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:52:16,315 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:52:16,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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:52:16,317 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 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:52:16,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:52:16,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:52:16,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 11:52:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 74 states have internal predecessors, (106), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:52:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 126 transitions. [2024-10-24 11:52:16,331 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 126 transitions. Word has length 93 [2024-10-24 11:52:16,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:16,333 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 126 transitions. [2024-10-24 11:52:16,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:52:16,334 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 126 transitions. [2024-10-24 11:52:16,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:52:16,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:16,338 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:16,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:52:16,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:16,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:16,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2049964467, now seen corresponding path program 1 times [2024-10-24 11:52:16,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:16,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995578611] [2024-10-24 11:52:16,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:16,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:52:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:52:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:52:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:52:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:52:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:52:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:52:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:52:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:16,574 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 11:52:16,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:16,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995578611] [2024-10-24 11:52:16,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995578611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:16,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:16,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:52:16,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162548623] [2024-10-24 11:52:16,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:16,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:52:16,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:16,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:52:16,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:52:16,581 INFO L87 Difference]: Start difference. First operand 86 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:52:16,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:16,621 INFO L93 Difference]: Finished difference Result 173 states and 254 transitions. [2024-10-24 11:52:16,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:52:16,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 93 [2024-10-24 11:52:16,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:16,624 INFO L225 Difference]: With dead ends: 173 [2024-10-24 11:52:16,624 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 11:52:16,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 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:52:16,625 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 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:52:16,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:52:16,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 11:52:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-24 11:52:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:52:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-10-24 11:52:16,640 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 93 [2024-10-24 11:52:16,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:16,641 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-10-24 11:52:16,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:52:16,641 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-10-24 11:52:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:52:16,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:16,642 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:16,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 11:52:16,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:16,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:16,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2147080840, now seen corresponding path program 1 times [2024-10-24 11:52:16,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:16,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31539107] [2024-10-24 11:52:16,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:16,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:52:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:52:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:52:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:52:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:52:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:52:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:52:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:52:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 11:52:17,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:17,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31539107] [2024-10-24 11:52:17,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31539107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:17,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:17,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:52:17,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710083886] [2024-10-24 11:52:17,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:17,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:52:17,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:17,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:52:17,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:52:17,504 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:52:17,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:17,747 INFO L93 Difference]: Finished difference Result 262 states and 382 transitions. [2024-10-24 11:52:17,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:52:17,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 95 [2024-10-24 11:52:17,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:17,750 INFO L225 Difference]: With dead ends: 262 [2024-10-24 11:52:17,750 INFO L226 Difference]: Without dead ends: 175 [2024-10-24 11:52:17,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:52:17,751 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 79 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:17,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 196 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:52:17,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-24 11:52:17,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2024-10-24 11:52:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 149 states have (on average 1.4161073825503356) internal successors, (211), 149 states have internal predecessors, (211), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:52:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 251 transitions. [2024-10-24 11:52:17,778 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 251 transitions. Word has length 95 [2024-10-24 11:52:17,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:17,779 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 251 transitions. [2024-10-24 11:52:17,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:52:17,779 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 251 transitions. [2024-10-24 11:52:17,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:52:17,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:17,780 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:17,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 11:52:17,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:17,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:17,785 INFO L85 PathProgramCache]: Analyzing trace with hash 868022778, now seen corresponding path program 1 times [2024-10-24 11:52:17,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:17,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015568986] [2024-10-24 11:52:17,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:17,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:18,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:52:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:18,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 11:52:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:18,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 11:52:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:18,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 11:52:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:18,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:52:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:18,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-24 11:52:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:18,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 11:52:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:18,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:52:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:18,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:52:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:18,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 11:52:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 11:52:18,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:52:18,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015568986] [2024-10-24 11:52:18,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015568986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:18,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:18,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:52:18,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112326132] [2024-10-24 11:52:18,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:18,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:52:18,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:52:18,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:52:18,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:52:18,059 INFO L87 Difference]: Start difference. First operand 172 states and 251 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:52:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:18,176 INFO L93 Difference]: Finished difference Result 397 states and 578 transitions. [2024-10-24 11:52:18,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 11:52:18,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 95 [2024-10-24 11:52:18,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:18,179 INFO L225 Difference]: With dead ends: 397 [2024-10-24 11:52:18,179 INFO L226 Difference]: Without dead ends: 226 [2024-10-24 11:52:18,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:52:18,181 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 66 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:18,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 301 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:52:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-24 11:52:18,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 190. [2024-10-24 11:52:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 167 states have (on average 1.4191616766467066) internal successors, (237), 167 states have internal predecessors, (237), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 11:52:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 277 transitions. [2024-10-24 11:52:18,192 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 277 transitions. Word has length 95 [2024-10-24 11:52:18,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:18,193 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 277 transitions. [2024-10-24 11:52:18,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:52:18,193 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 277 transitions. [2024-10-24 11:52:18,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:52:18,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:18,194 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:18,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 11:52:18,195 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:18,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:18,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1454828792, now seen corresponding path program 1 times [2024-10-24 11:52:18,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:52:18,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371671939] [2024-10-24 11:52:18,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:18,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:52:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:52:18,239 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:52:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:52:18,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:52:18,304 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:52:18,304 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:52:18,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 11:52:18,308 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 11:52:18,343 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:52:18,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:52:18 BoogieIcfgContainer [2024-10-24 11:52:18,345 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:52:18,345 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:52:18,345 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:52:18,346 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:52:18,346 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:15" (3/4) ... [2024-10-24 11:52:18,351 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:52:18,352 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:52:18,353 INFO L158 Benchmark]: Toolchain (without parser) took 4117.40ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 98.1MB in the beginning and 185.1MB in the end (delta: -87.0MB). Peak memory consumption was 72.2MB. Max. memory is 16.1GB. [2024-10-24 11:52:18,353 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:52:18,353 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.29ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 97.9MB in the beginning and 214.1MB in the end (delta: -116.2MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2024-10-24 11:52:18,353 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.23ms. Allocated memory is still 243.3MB. Free memory was 214.1MB in the beginning and 209.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:52:18,353 INFO L158 Benchmark]: Boogie Preprocessor took 79.06ms. Allocated memory is still 243.3MB. Free memory was 209.9MB in the beginning and 205.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:52:18,353 INFO L158 Benchmark]: RCFGBuilder took 674.39ms. Allocated memory is still 243.3MB. Free memory was 205.7MB in the beginning and 173.2MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-24 11:52:18,354 INFO L158 Benchmark]: TraceAbstraction took 2944.75ms. Allocated memory was 243.3MB in the beginning and 325.1MB in the end (delta: 81.8MB). Free memory was 173.2MB in the beginning and 186.2MB in the end (delta: -13.0MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2024-10-24 11:52:18,354 INFO L158 Benchmark]: Witness Printer took 6.67ms. Allocated memory is still 325.1MB. Free memory was 186.2MB in the beginning and 185.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:52:18,359 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.13ms. Allocated memory is still 167.8MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.29ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 97.9MB in the beginning and 214.1MB in the end (delta: -116.2MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.23ms. Allocated memory is still 243.3MB. Free memory was 214.1MB in the beginning and 209.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.06ms. Allocated memory is still 243.3MB. Free memory was 209.9MB in the beginning and 205.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 674.39ms. Allocated memory is still 243.3MB. Free memory was 205.7MB in the beginning and 173.2MB in the end (delta: 32.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2944.75ms. Allocated memory was 243.3MB in the beginning and 325.1MB in the end (delta: 81.8MB). Free memory was 173.2MB in the beginning and 186.2MB in the end (delta: -13.0MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * Witness Printer took 6.67ms. Allocated memory is still 325.1MB. Free memory was 186.2MB in the beginning and 185.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 102, overapproximation of someBinaryArithmeticDOUBLEoperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryArithmeticFLOAToperation at line 65. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -200, 0, 1, 100.55, 4.75, 128.75, 128.5, 0.0, 127.875, 1, 16 }; [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L81] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L82] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] WrapperStruct00.var_1_3 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L86] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L88] EXPR WrapperStruct00.var_1_10 [L88] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L88] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L88] EXPR WrapperStruct00.var_1_10 [L88] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L88] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L90] EXPR WrapperStruct00.var_1_11 [L90] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L90] EXPR WrapperStruct00.var_1_11 [L90] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L92] EXPR WrapperStruct00.var_1_13 [L92] EXPR WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 <= -1.0e-20F [L92] EXPR WrapperStruct00.var_1_13 [L92] EXPR WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR (WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR (WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L94] EXPR WrapperStruct00.var_1_14 [L94] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_14 [L94] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR (WrapperStruct00.var_1_14 >= 0.0F && 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}, isInitial=1] [L94] EXPR (WrapperStruct00.var_1_14 >= 0.0F && 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}, isInitial=1] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && 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}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && 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}, isInitial=1] [L95] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] RET updateVariables() [L111] CALL step() [L52] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L52] COND TRUE 0.8f > (- WrapperStruct00.var_1_10) [L53] EXPR WrapperStruct00.var_1_16 [L53] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L55] EXPR WrapperStruct00.var_1_15 [L55] EXPR WrapperStruct00.var_1_15 [L55] unsigned char stepLocal_1 = WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15; [L56] EXPR WrapperStruct00.var_1_3 [L56] unsigned char stepLocal_0 = WrapperStruct00.var_1_3; [L57] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L57] COND FALSE !(WrapperStruct00.var_1_2 && stepLocal_0) [L64] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L64] COND TRUE WrapperStruct00.var_1_2 [L65] EXPR WrapperStruct00.var_1_10 [L65] EXPR WrapperStruct00.var_1_11 [L65] WrapperStruct00.var_1_9 = (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11) [L73] EXPR WrapperStruct00.var_1_1 [L73] signed long int stepLocal_2 = WrapperStruct00.var_1_1; [L74] COND FALSE !(stepLocal_2 <= ((((8u) < 0 ) ? -(8u) : (8u)))) [L77] EXPR WrapperStruct00.var_1_13 [L77] EXPR WrapperStruct00.var_1_14 [L77] EXPR WrapperStruct00.var_1_11 [L77] WrapperStruct00.var_1_12 = ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_11) [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR WrapperStruct00.var_1_2 [L102] EXPR WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3 [L102] EXPR WrapperStruct00.var_1_3 [L102] EXPR WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1 [L102] EXPR (WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10)))) [L102] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))) [L102] EXPR WrapperStruct00.var_1_9 [L102] EXPR WrapperStruct00.var_1_10 [L102] EXPR WrapperStruct00.var_1_11 [L102] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))))) && ((WrapperStruct00.var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_10 - 99.5))) : (WrapperStruct00.var_1_12 == ((double) ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_11)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))))) && ((WrapperStruct00.var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_10 - 99.5))) : (WrapperStruct00.var_1_12 == ((double) ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_11)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR ((((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))))) && ((WrapperStruct00.var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_10 - 99.5))) : (WrapperStruct00.var_1_12 == ((double) ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_11))))) && ((0.8f > (- WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR ((((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))))) && ((WrapperStruct00.var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_10 - 99.5))) : (WrapperStruct00.var_1_12 == ((double) ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_11))))) && ((0.8f > (- WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L102-L103] return ((((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_3) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_15 > WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_1 == ((signed long int) (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_1 == ((signed long int) ((WrapperStruct00.var_1_15 + 5) - WrapperStruct00.var_1_15)))) : 1) && (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_9 == ((float) (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11))) : ((WrapperStruct00.var_1_1 < WrapperStruct00.var_1_15) ? (WrapperStruct00.var_1_9 == ((float) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_10))))) : (WrapperStruct00.var_1_9 == ((float) WrapperStruct00.var_1_10))))) && ((WrapperStruct00.var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_10 - 99.5))) : (WrapperStruct00.var_1_12 == ((double) ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_14) - WrapperStruct00.var_1_11))))) && ((0.8f > (- WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 6, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 1311 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 769 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 332 IncrementalHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 542 mSDtfsCounter, 332 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=5, InterpolantAutomatonStates: 19, 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, 5 MinimizatonAttempts, 39 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 564 NumberOfCodeBlocks, 564 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 464 ConstructedInterpolants, 0 QuantifiedInterpolants, 839 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 900/900 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:52:18,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-s_file-78.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 cc60dbcb40c1b152bb26088ff001d223dce864841f907f99b254c3b58eb0aa47 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:52:20,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:52:20,591 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:52:20,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:52:20,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:52:20,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:52:20,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:52:20,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:52:20,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:52:20,621 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:52:20,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:52:20,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:52:20,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:52:20,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:52:20,623 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:52:20,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:52:20,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:52:20,624 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:52:20,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:52:20,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:52:20,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:52:20,625 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:52:20,625 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:52:20,625 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:52:20,626 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:52:20,626 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:52:20,626 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:52:20,626 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:52:20,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:52:20,627 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:52:20,627 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:52:20,627 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:52:20,627 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:52:20,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:52:20,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:52:20,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:52:20,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:52:20,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:52:20,629 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:52:20,629 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:52:20,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:52:20,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:52:20,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:52:20,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:52:20,630 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:52:20,630 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 -> cc60dbcb40c1b152bb26088ff001d223dce864841f907f99b254c3b58eb0aa47 [2024-10-24 11:52:20,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:52:20,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:52:20,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:52:20,920 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:52:20,921 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:52:20,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-78.i [2024-10-24 11:52:22,307 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:52:22,494 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:52:22,495 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-78.i [2024-10-24 11:52:22,505 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c411e2d7/cf1cb60123964269a089952a3f980512/FLAGb66ba6679 [2024-10-24 11:52:22,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c411e2d7/cf1cb60123964269a089952a3f980512 [2024-10-24 11:52:22,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:52:22,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:52:22,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:52:22,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:52:22,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:52:22,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:52:22" (1/1) ... [2024-10-24 11:52:22,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd192fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:22, skipping insertion in model container [2024-10-24 11:52:22,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:52:22" (1/1) ... [2024-10-24 11:52:22,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:52:22,715 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-s_file-78.i[916,929] [2024-10-24 11:52:22,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:52:22,785 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:52:22,794 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-s_file-78.i[916,929] [2024-10-24 11:52:22,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:52:22,860 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:52:22,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:22 WrapperNode [2024-10-24 11:52:22,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:52:22,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:52:22,861 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:52:22,861 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:52:22,867 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:52:22" (1/1) ... [2024-10-24 11:52:22,886 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:52:22" (1/1) ... [2024-10-24 11:52:22,920 INFO L138 Inliner]: procedures = 36, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 411 [2024-10-24 11:52:22,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:52:22,921 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:52:22,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:52:22,922 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:52:22,930 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:22" (1/1) ... [2024-10-24 11:52:22,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:22" (1/1) ... [2024-10-24 11:52:22,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:22" (1/1) ... [2024-10-24 11:52:22,959 INFO L175 MemorySlicer]: Split 110 memory accesses to 2 slices as follows [2, 108]. 98 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 11]. The 15 writes are split as follows [0, 15]. [2024-10-24 11:52:22,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:22" (1/1) ... [2024-10-24 11:52:22,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:22" (1/1) ... [2024-10-24 11:52:22,985 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:22" (1/1) ... [2024-10-24 11:52:23,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:22" (1/1) ... [2024-10-24 11:52:23,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:22" (1/1) ... [2024-10-24 11:52:23,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:22" (1/1) ... [2024-10-24 11:52:23,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:52:23,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:52:23,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:52:23,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:52:23,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:22" (1/1) ... [2024-10-24 11:52:23,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:52:23,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:52:23,066 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:52:23,070 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:52:23,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:52:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-24 11:52:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-24 11:52:23,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-24 11:52:23,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-24 11:52:23,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 11:52:23,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 11:52:23,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:52:23,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 11:52:23,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-24 11:52:23,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-24 11:52:23,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-24 11:52:23,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-24 11:52:23,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-24 11:52:23,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-24 11:52:23,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 11:52:23,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 11:52:23,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-24 11:52:23,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-24 11:52:23,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-24 11:52:23,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-24 11:52:23,117 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:52:23,117 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:52:23,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:52:23,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:52:23,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-24 11:52:23,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-24 11:52:23,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 11:52:23,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 11:52:23,247 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:52:23,253 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:52:27,033 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-10-24 11:52:27,033 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:52:27,084 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:52:27,084 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:52:27,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:27 BoogieIcfgContainer [2024-10-24 11:52:27,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:52:27,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:52:27,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:52:27,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:52:27,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:52:22" (1/3) ... [2024-10-24 11:52:27,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6e553a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:52:27, skipping insertion in model container [2024-10-24 11:52:27,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:52:22" (2/3) ... [2024-10-24 11:52:27,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f6e553a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:52:27, skipping insertion in model container [2024-10-24 11:52:27,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:52:27" (3/3) ... [2024-10-24 11:52:27,108 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-78.i [2024-10-24 11:52:27,122 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:52:27,122 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:52:27,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:52:27,178 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;@375ea0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:52:27,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:52:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 74 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:52:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:52:27,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:27,191 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:27,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:27,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:27,196 INFO L85 PathProgramCache]: Analyzing trace with hash 315096233, now seen corresponding path program 1 times [2024-10-24 11:52:27,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:27,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505345744] [2024-10-24 11:52:27,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:27,214 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:52:27,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:27,216 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:52:27,218 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:52:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:27,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:52:27,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-24 11:52:27,563 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:27,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:27,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505345744] [2024-10-24 11:52:27,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505345744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:27,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:27,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:52:27,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716414937] [2024-10-24 11:52:27,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:27,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:52:27,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:27,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:52:27,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:52:27,596 INFO L87 Difference]: Start difference. First operand has 86 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 74 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:52:27,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:27,652 INFO L93 Difference]: Finished difference Result 169 states and 266 transitions. [2024-10-24 11:52:27,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:52:27,655 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2024-10-24 11:52:27,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:27,662 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:52:27,662 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 11:52:27,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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:52:27,671 INFO L432 NwaCegarLoop]: 120 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, 120 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:52:27,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:52:27,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 11:52:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 11:52:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 72 states have internal predecessors, (104), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:52:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2024-10-24 11:52:27,715 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 93 [2024-10-24 11:52:27,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:27,716 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2024-10-24 11:52:27,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:52:27,717 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2024-10-24 11:52:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:52:27,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:27,726 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:27,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:52:27,930 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:52:27,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:27,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2034445749, now seen corresponding path program 1 times [2024-10-24 11:52:27,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:27,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989939305] [2024-10-24 11:52:27,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:27,933 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:52:27,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:27,936 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:52:27,937 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:52:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:28,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:52:28,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:52:28,288 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:28,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:28,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989939305] [2024-10-24 11:52:28,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989939305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:28,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:28,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:52:28,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695449447] [2024-10-24 11:52:28,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:28,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:52:28,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:28,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:52:28,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:52:28,294 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:52:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:28,411 INFO L93 Difference]: Finished difference Result 169 states and 250 transitions. [2024-10-24 11:52:28,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:52:28,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2024-10-24 11:52:28,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:28,413 INFO L225 Difference]: With dead ends: 169 [2024-10-24 11:52:28,413 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 11:52:28,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 90 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:52:28,414 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:28,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:52:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 11:52:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 11:52:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 74 states have internal predecessors, (106), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:52:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 126 transitions. [2024-10-24 11:52:28,421 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 126 transitions. Word has length 93 [2024-10-24 11:52:28,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:28,423 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 126 transitions. [2024-10-24 11:52:28,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:52:28,423 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 126 transitions. [2024-10-24 11:52:28,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 11:52:28,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:28,425 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:28,436 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:52:28,625 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:52:28,626 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:28,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:28,627 INFO L85 PathProgramCache]: Analyzing trace with hash 2049964467, now seen corresponding path program 1 times [2024-10-24 11:52:28,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:28,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253034640] [2024-10-24 11:52:28,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:28,628 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:52:28,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:28,631 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:52:28,632 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:52:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:28,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 11:52:28,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 11:52:28,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:28,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:28,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253034640] [2024-10-24 11:52:28,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253034640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:28,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:28,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:52:28,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237089655] [2024-10-24 11:52:28,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:28,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:52:28,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:28,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:52:28,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:52:28,986 INFO L87 Difference]: Start difference. First operand 86 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:52:29,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:29,066 INFO L93 Difference]: Finished difference Result 173 states and 254 transitions. [2024-10-24 11:52:29,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:52:29,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 93 [2024-10-24 11:52:29,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:29,068 INFO L225 Difference]: With dead ends: 173 [2024-10-24 11:52:29,068 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 11:52:29,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 90 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:52:29,070 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:29,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 347 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:52:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 11:52:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-24 11:52:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 76 states have internal predecessors, (108), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:52:29,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-10-24 11:52:29,076 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 93 [2024-10-24 11:52:29,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:29,077 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-10-24 11:52:29,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:52:29,077 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-10-24 11:52:29,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:52:29,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:29,078 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:29,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 11:52:29,282 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:52:29,283 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:29,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:29,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2147080840, now seen corresponding path program 1 times [2024-10-24 11:52:29,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:29,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669431155] [2024-10-24 11:52:29,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:29,285 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:52:29,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:29,287 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:52:29,288 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:52:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:29,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:52:29,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-24 11:52:29,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:29,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:29,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669431155] [2024-10-24 11:52:29,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669431155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:29,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:29,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:52:29,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759978319] [2024-10-24 11:52:29,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:29,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 11:52:29,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:29,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 11:52:29,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:52:29,768 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:52:32,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:52:35,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:52:36,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:52:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:37,108 INFO L93 Difference]: Finished difference Result 198 states and 286 transitions. [2024-10-24 11:52:37,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:52:37,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 95 [2024-10-24 11:52:37,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:37,110 INFO L225 Difference]: With dead ends: 198 [2024-10-24 11:52:37,110 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 11:52:37,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:52:37,111 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 27 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:37,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 383 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2024-10-24 11:52:37,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 11:52:37,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 92. [2024-10-24 11:52:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:52:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2024-10-24 11:52:37,117 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 95 [2024-10-24 11:52:37,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:37,118 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2024-10-24 11:52:37,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-24 11:52:37,118 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2024-10-24 11:52:37,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 11:52:37,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:37,119 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:37,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 11:52:37,323 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:52:37,324 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:37,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:37,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1560274826, now seen corresponding path program 1 times [2024-10-24 11:52:37,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:37,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224471236] [2024-10-24 11:52:37,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:37,325 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:52:37,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:37,335 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:52:37,341 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:52:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:37,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:52:37,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:37,798 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:52:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:52:37,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:37,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:37,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224471236] [2024-10-24 11:52:37,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224471236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:37,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:37,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:52:37,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856147664] [2024-10-24 11:52:37,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:37,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:52:37,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:37,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:52:37,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:52:37,832 INFO L87 Difference]: Start difference. First operand 92 states and 132 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:52:40,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:52:42,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:52:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:42,240 INFO L93 Difference]: Finished difference Result 184 states and 264 transitions. [2024-10-24 11:52:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:52:42,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 95 [2024-10-24 11:52:42,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:42,242 INFO L225 Difference]: With dead ends: 184 [2024-10-24 11:52:42,242 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:52:42,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:52:42,244 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 106 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:42,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 315 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-24 11:52:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:52:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-24 11:52:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:52:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2024-10-24 11:52:42,254 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 95 [2024-10-24 11:52:42,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:42,254 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2024-10-24 11:52:42,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:52:42,255 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2024-10-24 11:52:42,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 11:52:42,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:42,256 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:42,277 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 (6)] Ended with exit code 0 [2024-10-24 11:52:42,459 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:52:42,460 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:42,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:42,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1107366714, now seen corresponding path program 1 times [2024-10-24 11:52:42,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:42,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318400488] [2024-10-24 11:52:42,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:42,463 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:52:42,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:42,465 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:52:42,467 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:52:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:42,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 11:52:42,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-24 11:52:42,813 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:42,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:42,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318400488] [2024-10-24 11:52:42,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318400488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:42,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:42,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 11:52:42,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542981564] [2024-10-24 11:52:42,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:42,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:52:42,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:42,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:52:42,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:52:42,815 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 11:52:42,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:42,983 INFO L93 Difference]: Finished difference Result 187 states and 266 transitions. [2024-10-24 11:52:42,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:52:42,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 97 [2024-10-24 11:52:42,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:42,985 INFO L225 Difference]: With dead ends: 187 [2024-10-24 11:52:42,985 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 11:52:42,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 11:52:42,986 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:42,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 502 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:52:42,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 11:52:42,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2024-10-24 11:52:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:52:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2024-10-24 11:52:42,992 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 97 [2024-10-24 11:52:42,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:42,992 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2024-10-24 11:52:42,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.2) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 11:52:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2024-10-24 11:52:42,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 11:52:42,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:42,993 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:43,005 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:52:43,197 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:52:43,198 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:43,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:43,199 INFO L85 PathProgramCache]: Analyzing trace with hash 153426556, now seen corresponding path program 1 times [2024-10-24 11:52:43,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:43,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278331376] [2024-10-24 11:52:43,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:43,199 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:52:43,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:43,201 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:52:43,203 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:52:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:43,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:52:43,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:43,665 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:52:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-24 11:52:43,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:43,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:43,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278331376] [2024-10-24 11:52:43,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278331376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:43,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:43,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:52:43,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083573025] [2024-10-24 11:52:43,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:43,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:52:43,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:43,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:52:43,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:52:43,695 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:52:46,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:52:49,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:52:49,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:49,470 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2024-10-24 11:52:49,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:52:49,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 97 [2024-10-24 11:52:49,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:49,472 INFO L225 Difference]: With dead ends: 184 [2024-10-24 11:52:49,472 INFO L226 Difference]: Without dead ends: 93 [2024-10-24 11:52:49,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:52:49,473 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 97 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:49,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 309 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-24 11:52:49,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-24 11:52:49,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-24 11:52:49,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:52:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2024-10-24 11:52:49,480 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 97 [2024-10-24 11:52:49,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:49,480 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2024-10-24 11:52:49,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:52:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2024-10-24 11:52:49,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 11:52:49,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:49,482 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:49,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 (8)] Ended with exit code 0 [2024-10-24 11:52:49,682 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:52:49,682 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:49,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:49,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1929104438, now seen corresponding path program 1 times [2024-10-24 11:52:49,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:49,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506781662] [2024-10-24 11:52:49,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:49,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:52:49,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:49,686 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:52:49,688 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:52:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:49,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:52:49,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:50,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:52:50,263 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 175 treesize of output 67 [2024-10-24 11:52:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 11:52:50,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:50,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:50,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506781662] [2024-10-24 11:52:50,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506781662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:50,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:50,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:52:50,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147081762] [2024-10-24 11:52:50,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:50,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:52:50,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:50,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:52:50,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:52:50,302 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:52:53,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:52:55,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:52:55,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:52:55,408 INFO L93 Difference]: Finished difference Result 183 states and 257 transitions. [2024-10-24 11:52:55,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:52:55,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2024-10-24 11:52:55,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:52:55,410 INFO L225 Difference]: With dead ends: 183 [2024-10-24 11:52:55,410 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 11:52:55,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:52:55,410 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 89 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:52:55,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 306 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-10-24 11:52:55,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 11:52:55,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2024-10-24 11:52:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.358974358974359) internal successors, (106), 78 states have internal predecessors, (106), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:52:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2024-10-24 11:52:55,415 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 99 [2024-10-24 11:52:55,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:52:55,416 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2024-10-24 11:52:55,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:52:55,416 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2024-10-24 11:52:55,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 11:52:55,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:52:55,417 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:55,432 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 (9)] Ended with exit code 0 [2024-10-24 11:52:55,621 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:52:55,622 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:52:55,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:52:55,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1983951678, now seen corresponding path program 1 times [2024-10-24 11:52:55,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:52:55,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509622301] [2024-10-24 11:52:55,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:52:55,623 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:52:55,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:52:55,625 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:52:55,626 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:52:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:52:56,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 11:52:56,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:52:56,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:52:56,347 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 173 treesize of output 65 [2024-10-24 11:52:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-24 11:52:56,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:52:56,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:52:56,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509622301] [2024-10-24 11:52:56,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509622301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:52:56,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:52:56,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 11:52:56,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431459293] [2024-10-24 11:52:56,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:52:56,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 11:52:56,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:52:56,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 11:52:56,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 11:52:56,396 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:52:59,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:53:01,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:53:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:01,732 INFO L93 Difference]: Finished difference Result 180 states and 252 transitions. [2024-10-24 11:53:01,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 11:53:01,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2024-10-24 11:53:01,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:01,733 INFO L225 Difference]: With dead ends: 180 [2024-10-24 11:53:01,733 INFO L226 Difference]: Without dead ends: 91 [2024-10-24 11:53:01,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 11:53:01,734 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 78 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:01,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 300 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-24 11:53:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-24 11:53:01,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-24 11:53:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-24 11:53:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2024-10-24 11:53:01,745 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 101 [2024-10-24 11:53:01,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:01,746 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2024-10-24 11:53:01,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 11:53:01,746 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2024-10-24 11:53:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:53:01,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:01,750 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:01,764 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 (10)] Forceful destruction successful, exit code 0 [2024-10-24 11:53:01,950 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:53:01,951 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:01,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:01,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1452374648, now seen corresponding path program 1 times [2024-10-24 11:53:01,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:01,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184636389] [2024-10-24 11:53:01,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:01,953 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:53:01,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:01,960 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:53:01,962 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:53:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:02,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-24 11:53:02,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:02,451 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 0 case distinctions, treesize of input 24 treesize of output 23 [2024-10-24 11:53:02,638 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:02,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-10-24 11:53:02,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:02,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-10-24 11:53:02,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:02,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 26 [2024-10-24 11:53:03,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:03,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 46 [2024-10-24 11:53:07,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:07,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 52 [2024-10-24 11:53:07,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:07,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 62 [2024-10-24 11:53:08,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:08,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 76 [2024-10-24 11:53:08,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:08,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 80 [2024-10-24 11:53:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-24 11:53:08,418 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:53:08,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:53:08,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184636389] [2024-10-24 11:53:08,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184636389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:53:08,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:53:08,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 11:53:08,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218745535] [2024-10-24 11:53:08,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:53:08,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 11:53:08,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:53:08,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 11:53:08,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=32, Unknown=1, NotChecked=0, Total=56 [2024-10-24 11:53:08,420 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 11:53:11,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:53:13,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:53:15,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:53:20,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-24 11:53:23,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 11:53:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:53:24,298 INFO L93 Difference]: Finished difference Result 352 states and 489 transitions. [2024-10-24 11:53:24,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 11:53:24,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 103 [2024-10-24 11:53:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:53:24,300 INFO L225 Difference]: With dead ends: 352 [2024-10-24 11:53:24,301 INFO L226 Difference]: Without dead ends: 263 [2024-10-24 11:53:24,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=39, Invalid=50, Unknown=1, NotChecked=0, Total=90 [2024-10-24 11:53:24,301 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 434 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2024-10-24 11:53:24,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 289 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 15.7s Time] [2024-10-24 11:53:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-24 11:53:24,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 256. [2024-10-24 11:53:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 224 states have (on average 1.3392857142857142) internal successors, (300), 225 states have internal predecessors, (300), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 11:53:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 356 transitions. [2024-10-24 11:53:24,318 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 356 transitions. Word has length 103 [2024-10-24 11:53:24,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:53:24,318 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 356 transitions. [2024-10-24 11:53:24,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-24 11:53:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 356 transitions. [2024-10-24 11:53:24,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-24 11:53:24,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:53:24,319 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:24,332 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 (11)] Forceful destruction successful, exit code 0 [2024-10-24 11:53:24,519 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:53:24,520 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:53:24,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:53:24,520 INFO L85 PathProgramCache]: Analyzing trace with hash 172510970, now seen corresponding path program 1 times [2024-10-24 11:53:24,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:53:24,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832856601] [2024-10-24 11:53:24,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:53:24,521 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:53:24,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:53:24,522 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:53:24,524 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:53:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:53:44,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-24 11:53:44,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:53:44,999 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 19 treesize of output 1 [2024-10-24 11:53:45,554 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 0 case distinctions, treesize of input 78 treesize of output 32 [2024-10-24 11:53:46,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:46,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 63 [2024-10-24 11:53:47,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:47,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 63 [2024-10-24 11:53:47,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:47,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 73 [2024-10-24 11:53:48,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:48,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 87 [2024-10-24 11:53:49,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:49,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 241 treesize of output 132 [2024-10-24 11:53:52,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 11:53:52,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 237 treesize of output 144