./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-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-10.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 b01652b30ec09a692ad6378ed531eb12202ad1b62f1f35df71071640dd6a83a1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:24:44,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:24:44,130 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:24:44,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:24:44,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:24:44,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:24:44,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:24:44,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:24:44,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:24:44,171 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:24:44,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:24:44,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:24:44,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:24:44,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:24:44,177 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:24:44,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:24:44,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:24:44,178 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:24:44,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:24:44,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:24:44,180 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:24:44,184 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:24:44,184 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:24:44,184 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:24:44,184 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:24:44,185 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:24:44,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:24:44,185 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:24:44,186 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:24:44,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:24:44,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:24:44,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:24:44,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:24:44,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:24:44,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:24:44,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:24:44,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:24:44,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:24:44,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:24:44,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:24:44,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:24:44,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:24:44,194 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 -> b01652b30ec09a692ad6378ed531eb12202ad1b62f1f35df71071640dd6a83a1 [2024-10-13 06:24:44,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:24:44,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:24:44,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:24:44,543 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:24:44,543 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:24:44,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-10.i [2024-10-13 06:24:46,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:24:46,328 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:24:46,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-10.i [2024-10-13 06:24:46,339 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700260747/b68e092ef1aa442397540127ecd429b7/FLAG7490ba4e3 [2024-10-13 06:24:46,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700260747/b68e092ef1aa442397540127ecd429b7 [2024-10-13 06:24:46,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:24:46,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:24:46,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:24:46,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:24:46,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:24:46,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:24:46" (1/1) ... [2024-10-13 06:24:46,372 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673c44f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:46, skipping insertion in model container [2024-10-13 06:24:46,372 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:24:46" (1/1) ... [2024-10-13 06:24:46,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:24:46,594 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-10.i[916,929] [2024-10-13 06:24:46,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:24:46,715 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:24:46,728 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-10.i[916,929] [2024-10-13 06:24:46,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:24:46,872 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:24:46,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:46 WrapperNode [2024-10-13 06:24:46,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:24:46,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:24:46,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:24:46,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:24:46,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:46" (1/1) ... [2024-10-13 06:24:46,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:46" (1/1) ... [2024-10-13 06:24:46,947 INFO L138 Inliner]: procedures = 29, calls = 173, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 489 [2024-10-13 06:24:46,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:24:46,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:24:46,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:24:46,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:24:46,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:46" (1/1) ... [2024-10-13 06:24:46,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:46" (1/1) ... [2024-10-13 06:24:46,978 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:46" (1/1) ... [2024-10-13 06:24:47,000 INFO L175 MemorySlicer]: Split 142 memory accesses to 2 slices as follows [2, 140]. 99 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 18]. The 22 writes are split as follows [0, 22]. [2024-10-13 06:24:47,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:46" (1/1) ... [2024-10-13 06:24:47,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:46" (1/1) ... [2024-10-13 06:24:47,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:46" (1/1) ... [2024-10-13 06:24:47,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:46" (1/1) ... [2024-10-13 06:24:47,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:46" (1/1) ... [2024-10-13 06:24:47,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:46" (1/1) ... [2024-10-13 06:24:47,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:24:47,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:24:47,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:24:47,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:24:47,058 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:46" (1/1) ... [2024-10-13 06:24:47,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:24:47,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:24:47,104 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-13 06:24:47,112 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-13 06:24:47,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:24:47,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:24:47,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:24:47,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:24:47,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:24:47,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:24:47,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:24:47,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:24:47,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:24:47,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:24:47,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:24:47,176 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:24:47,176 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:24:47,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:24:47,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:24:47,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:24:47,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:24:47,319 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:24:47,321 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:24:47,934 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-10-13 06:24:47,935 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:24:47,969 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:24:47,970 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:24:47,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:24:47 BoogieIcfgContainer [2024-10-13 06:24:47,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:24:47,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:24:47,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:24:47,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:24:47,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:24:46" (1/3) ... [2024-10-13 06:24:47,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c497e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:24:47, skipping insertion in model container [2024-10-13 06:24:47,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:46" (2/3) ... [2024-10-13 06:24:47,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c497e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:24:47, skipping insertion in model container [2024-10-13 06:24:47,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:24:47" (3/3) ... [2024-10-13 06:24:47,981 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-10.i [2024-10-13 06:24:47,999 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:24:47,999 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:24:48,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:24:48,068 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;@4cede365, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:24:48,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:24:48,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 83 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 06:24:48,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:48,090 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:48,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:48,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:48,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1426010592, now seen corresponding path program 1 times [2024-10-13 06:24:48,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:48,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042418346] [2024-10-13 06:24:48,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:48,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:24:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:24:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:24:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:24:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:24:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:24:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:24:48,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:24:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:24:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:24:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:24:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:24:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:24:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:24:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:24:48,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:24:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:24:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:24:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:24:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:24:48,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:48,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042418346] [2024-10-13 06:24:48,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042418346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:48,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:48,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:24:48,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670731076] [2024-10-13 06:24:48,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:48,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:24:48,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:48,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:24:48,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:24:48,695 INFO L87 Difference]: Start difference. First operand has 104 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 83 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:24:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:48,765 INFO L93 Difference]: Finished difference Result 205 states and 325 transitions. [2024-10-13 06:24:48,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:24:48,770 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2024-10-13 06:24:48,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:48,807 INFO L225 Difference]: With dead ends: 205 [2024-10-13 06:24:48,807 INFO L226 Difference]: Without dead ends: 102 [2024-10-13 06:24:48,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:24:48,815 INFO L432 NwaCegarLoop]: 143 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, 143 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-13 06:24:48,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:24:48,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-13 06:24:48,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-13 06:24:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.345679012345679) internal successors, (109), 81 states have internal predecessors, (109), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 147 transitions. [2024-10-13 06:24:48,907 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 147 transitions. Word has length 147 [2024-10-13 06:24:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:48,908 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 147 transitions. [2024-10-13 06:24:48,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:24:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 147 transitions. [2024-10-13 06:24:48,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 06:24:48,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:48,914 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:48,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:24:48,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:48,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:48,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2089719354, now seen corresponding path program 1 times [2024-10-13 06:24:48,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:48,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832856738] [2024-10-13 06:24:48,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:48,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:24:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:24:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:24:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:24:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:24:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:24:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:24:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:24:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:24:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:24:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:24:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:24:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:24:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:24:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:24:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:24:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:24:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:24:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:24:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:24:49,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:49,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832856738] [2024-10-13 06:24:49,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832856738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:49,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:49,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:24:49,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906233599] [2024-10-13 06:24:49,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:49,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:24:49,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:49,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:24:49,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:24:49,344 INFO L87 Difference]: Start difference. First operand 102 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:24:49,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:49,430 INFO L93 Difference]: Finished difference Result 205 states and 296 transitions. [2024-10-13 06:24:49,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:24:49,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2024-10-13 06:24:49,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:49,433 INFO L225 Difference]: With dead ends: 205 [2024-10-13 06:24:49,433 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 06:24:49,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-13 06:24:49,437 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 416 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-13 06:24:49,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 416 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:24:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 06:24:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-13 06:24:49,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2024-10-13 06:24:49,465 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 147 [2024-10-13 06:24:49,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:49,466 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2024-10-13 06:24:49,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:24:49,468 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2024-10-13 06:24:49,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 06:24:49,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:49,473 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:49,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:24:49,474 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:49,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:49,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1841781444, now seen corresponding path program 1 times [2024-10-13 06:24:49,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:49,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998380656] [2024-10-13 06:24:49,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:49,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:24:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:24:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:24:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:24:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:24:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:24:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:24:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:24:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:24:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:24:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:24:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:24:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:24:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:24:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:24:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:24:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:24:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:24:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:24:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:24:49,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:49,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998380656] [2024-10-13 06:24:49,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998380656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:49,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:49,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:24:49,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437818469] [2024-10-13 06:24:49,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:49,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:24:49,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:49,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:24:49,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:24:49,879 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:24:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:50,025 INFO L93 Difference]: Finished difference Result 210 states and 301 transitions. [2024-10-13 06:24:50,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:24:50,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2024-10-13 06:24:50,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:50,029 INFO L225 Difference]: With dead ends: 210 [2024-10-13 06:24:50,029 INFO L226 Difference]: Without dead ends: 107 [2024-10-13 06:24:50,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-13 06:24:50,037 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:50,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 413 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:24:50,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-13 06:24:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-10-13 06:24:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 85 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:50,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2024-10-13 06:24:50,050 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 147 [2024-10-13 06:24:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:50,051 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2024-10-13 06:24:50,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:24:50,052 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2024-10-13 06:24:50,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 06:24:50,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:50,054 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:50,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:24:50,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:50,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:50,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1032434818, now seen corresponding path program 1 times [2024-10-13 06:24:50,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:50,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386310456] [2024-10-13 06:24:50,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:50,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:24:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:24:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:24:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:24:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:24:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:24:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:24:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:24:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:24:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:24:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:24:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:24:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:24:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:24:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:24:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:24:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:24:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:24:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:24:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:24:50,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:50,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386310456] [2024-10-13 06:24:50,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386310456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:50,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:50,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:24:50,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898116156] [2024-10-13 06:24:50,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:50,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:24:50,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:50,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:24:50,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:24:50,312 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:24:50,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:50,367 INFO L93 Difference]: Finished difference Result 214 states and 305 transitions. [2024-10-13 06:24:50,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:24:50,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2024-10-13 06:24:50,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:50,369 INFO L225 Difference]: With dead ends: 214 [2024-10-13 06:24:50,369 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 06:24:50,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-13 06:24:50,371 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:50,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 414 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:24:50,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 06:24:50,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-10-13 06:24:50,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 87 states have internal predecessors, (115), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:50,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2024-10-13 06:24:50,391 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 147 [2024-10-13 06:24:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:50,394 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2024-10-13 06:24:50,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:24:50,394 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2024-10-13 06:24:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 06:24:50,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:50,397 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:50,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:24:50,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:50,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:50,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1089693120, now seen corresponding path program 1 times [2024-10-13 06:24:50,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:50,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589529989] [2024-10-13 06:24:50,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:50,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:24:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:24:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:24:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:24:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:24:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:24:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:24:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:24:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:24:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:24:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:24:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:24:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:24:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:24:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:24:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:24:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:24:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:24:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:24:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:24:50,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:50,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589529989] [2024-10-13 06:24:50,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589529989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:50,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:50,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:24:50,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544807826] [2024-10-13 06:24:50,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:50,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:24:50,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:50,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:24:50,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:24:50,641 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:24:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:50,698 INFO L93 Difference]: Finished difference Result 218 states and 309 transitions. [2024-10-13 06:24:50,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:24:50,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2024-10-13 06:24:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:50,702 INFO L225 Difference]: With dead ends: 218 [2024-10-13 06:24:50,702 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 06:24:50,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-13 06:24:50,707 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:50,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 417 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:24:50,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 06:24:50,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-10-13 06:24:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 89 states have internal predecessors, (117), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:50,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2024-10-13 06:24:50,730 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 147 [2024-10-13 06:24:50,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:50,731 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2024-10-13 06:24:50,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:24:50,731 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2024-10-13 06:24:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 06:24:50,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:50,735 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:50,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:24:50,736 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:50,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:50,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1089752702, now seen corresponding path program 1 times [2024-10-13 06:24:50,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:50,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272413629] [2024-10-13 06:24:50,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:50,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:24:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:24:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:24:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:24:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:24:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 06:24:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 06:24:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:24:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:24:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:24:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:24:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:24:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:24:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:24:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 06:24:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 06:24:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 06:24:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 06:24:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 06:24:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:24:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:24:53,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:24:53,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272413629] [2024-10-13 06:24:53,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272413629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:24:53,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:24:53,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:24:53,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969403221] [2024-10-13 06:24:53,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:24:53,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:24:53,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:24:53,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:24:53,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:24:53,374 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:24:53,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:24:53,581 INFO L93 Difference]: Finished difference Result 220 states and 310 transitions. [2024-10-13 06:24:53,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:24:53,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2024-10-13 06:24:53,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:24:53,584 INFO L225 Difference]: With dead ends: 220 [2024-10-13 06:24:53,584 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 06:24:53,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:24:53,585 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 49 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:24:53,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 333 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:24:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 06:24:53,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-10-13 06:24:53,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.303370786516854) internal successors, (116), 89 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:24:53,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 154 transitions. [2024-10-13 06:24:53,600 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 154 transitions. Word has length 147 [2024-10-13 06:24:53,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:24:53,601 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 154 transitions. [2024-10-13 06:24:53,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.75) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:24:53,601 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 154 transitions. [2024-10-13 06:24:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 06:24:53,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:24:53,603 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:24:53,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:24:53,604 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:24:53,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:24:53,604 INFO L85 PathProgramCache]: Analyzing trace with hash -57754013, now seen corresponding path program 1 times [2024-10-13 06:24:53,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:24:53,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209926816] [2024-10-13 06:24:53,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:24:53,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:24:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:24:53,807 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:24:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:24:53,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:24:53,952 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:24:53,953 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:24:53,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:24:53,958 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:24:54,030 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:24:54,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:24:54 BoogieIcfgContainer [2024-10-13 06:24:54,037 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:24:54,038 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:24:54,038 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:24:54,038 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:24:54,039 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:24:47" (3/4) ... [2024-10-13 06:24:54,041 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:24:54,042 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:24:54,043 INFO L158 Benchmark]: Toolchain (without parser) took 7683.41ms. Allocated memory was 176.2MB in the beginning and 373.3MB in the end (delta: 197.1MB). Free memory was 102.9MB in the beginning and 290.8MB in the end (delta: -187.9MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-10-13 06:24:54,043 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 176.2MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:24:54,044 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.87ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 102.9MB in the beginning and 206.1MB in the end (delta: -103.2MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-10-13 06:24:54,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.40ms. Allocated memory is still 237.0MB. Free memory was 206.1MB in the beginning and 201.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:24:54,044 INFO L158 Benchmark]: Boogie Preprocessor took 102.52ms. Allocated memory is still 237.0MB. Free memory was 201.9MB in the beginning and 197.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:24:54,044 INFO L158 Benchmark]: RCFGBuilder took 914.60ms. Allocated memory is still 237.0MB. Free memory was 197.7MB in the beginning and 161.0MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-13 06:24:54,045 INFO L158 Benchmark]: TraceAbstraction took 6063.74ms. Allocated memory was 237.0MB in the beginning and 373.3MB in the end (delta: 136.3MB). Free memory was 160.0MB in the beginning and 291.9MB in the end (delta: -131.9MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2024-10-13 06:24:54,045 INFO L158 Benchmark]: Witness Printer took 4.83ms. Allocated memory is still 373.3MB. Free memory was 291.9MB in the beginning and 290.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 06:24:54,046 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.27ms. Allocated memory is still 176.2MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.87ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 102.9MB in the beginning and 206.1MB in the end (delta: -103.2MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.40ms. Allocated memory is still 237.0MB. Free memory was 206.1MB in the beginning and 201.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 102.52ms. Allocated memory is still 237.0MB. Free memory was 201.9MB in the beginning and 197.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 914.60ms. Allocated memory is still 237.0MB. Free memory was 197.7MB in the beginning and 161.0MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6063.74ms. Allocated memory was 237.0MB in the beginning and 373.3MB in the end (delta: 136.3MB). Free memory was 160.0MB in the beginning and 291.9MB in the end (delta: -131.9MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Witness Printer took 4.83ms. Allocated memory is still 373.3MB. Free memory was 291.9MB in the beginning and 290.8MB 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 someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someUnaryDOUBLEoperation at line 84. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 5, 8, 9.15, 1000000.875, 49.25, -0.8, -10, 58996, 32, 32, 16, 2, 32, 1000000000, -0.5, 2, 0, 0 }; [L63] double last_1_WrapperStruct00_var_1_3 = 9.15; [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] CALL updateLastVariables() [L126] EXPR WrapperStruct00.var_1_3 [L126] last_1_WrapperStruct00_var_1_3 = WrapperStruct00.var_1_3 [L136] RET updateLastVariables() [L137] CALL updateVariables() [L94] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ulong() [L95] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L96] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L97] WrapperStruct00.var_1_6 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct00.var_1_6 [L98] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L98] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_6 [L98] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L98] EXPR (WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L98] EXPR (WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L99] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L100] EXPR WrapperStruct00.var_1_7 [L100] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L100] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_7 [L100] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L100] EXPR (WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L100] EXPR (WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L101] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L102] EXPR WrapperStruct00.var_1_8 [L102] EXPR WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L102] EXPR WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_8 [L102] EXPR WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L102] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L102] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L103] WrapperStruct00.var_1_10 = __VERIFIER_nondet_ushort() [L104] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L105] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L106] WrapperStruct00.var_1_11 = __VERIFIER_nondet_ushort() [L107] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L108] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L109] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L110] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L111] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L112] WrapperStruct00.var_1_13 = __VERIFIER_nondet_char() [L113] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L114] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L115] WrapperStruct00.var_1_14 = __VERIFIER_nondet_char() [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L117] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L118] WrapperStruct00.var_1_17 = __VERIFIER_nondet_long() [L119] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 536870911) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 536870911) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L120] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 1073741823) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 1073741823) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L121] WrapperStruct00.var_1_21 = __VERIFIER_nondet_uchar() [L122] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_21 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_21 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L123] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_21 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_21 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L137] RET updateVariables() [L138] CALL step() [L67] EXPR WrapperStruct00.var_1_2 [L67] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_2 [L68] EXPR WrapperStruct00.var_1_8 [L68] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_8 [L69] EXPR WrapperStruct00.var_1_12 [L69] WrapperStruct00.var_1_19 = WrapperStruct00.var_1_12 [L70] EXPR WrapperStruct00.var_1_21 [L70] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_21 [L71] EXPR WrapperStruct00.var_1_19 [L71] signed char stepLocal_1 = WrapperStruct00.var_1_19; [L72] EXPR WrapperStruct00.var_1_10 [L72] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L72] COND FALSE !((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= stepLocal_1) [L75] EXPR WrapperStruct00.var_1_12 [L75] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L75] EXPR ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14) [L75] EXPR WrapperStruct00.var_1_12 [L75] EXPR ((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L75] WrapperStruct00.var_1_9 = ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))) [L77] WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L77] COND TRUE WrapperStruct00.var_1_20 [L78] EXPR WrapperStruct00.var_1_12 [L78] EXPR WrapperStruct00.var_1_14 [L78] WrapperStruct00.var_1_15 = (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14) [L82] EXPR WrapperStruct00.var_1_15 [L82] signed long int stepLocal_0 = WrapperStruct00.var_1_15; [L83] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L83] COND TRUE stepLocal_0 < WrapperStruct00.var_1_1 [L84] WrapperStruct00.var_1_3 = -0.5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR WrapperStruct00.var_1_1 [L129] EXPR WrapperStruct00.var_1_2 [L129] EXPR (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)))) [L129] EXPR WrapperStruct00.var_1_15 [L129] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR (WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))) [L129] EXPR WrapperStruct00.var_1_3 [L129] EXPR (WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR ((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR ((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR (((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))))))) && (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_13 - ((WrapperStruct00.var_1_17 - 4) + ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR (((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))))))) && (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_13 - ((WrapperStruct00.var_1_17 - 4) + ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR ((((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))))))) && (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_13 - ((WrapperStruct00.var_1_17 - 4) + ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR ((((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))))))) && (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_13 - ((WrapperStruct00.var_1_17 - 4) + ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR (((((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))))))) && (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_13 - ((WrapperStruct00.var_1_17 - 4) + ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR (((((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))))))) && (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_13 - ((WrapperStruct00.var_1_17 - 4) + ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR ((((((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))))))) && (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_13 - ((WrapperStruct00.var_1_17 - 4) + ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_20 == ((unsigned char) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129] EXPR ((((((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))))))) && (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_13 - ((WrapperStruct00.var_1_17 - 4) + ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_20 == ((unsigned char) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L129-L130] return ((((((WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_2)) && ((WrapperStruct00.var_1_15 < WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_3 == ((double) -0.5)) : (((- last_1_WrapperStruct00_var_1_3) == (WrapperStruct00.var_1_6 - WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_3 == ((double) WrapperStruct00.var_1_8))))) && (((- (WrapperStruct00.var_1_10 - WrapperStruct00.var_1_11)) >= WrapperStruct00.var_1_19) ? (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14)))))) : (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_14))))))) && (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((signed long int) (WrapperStruct00.var_1_13 - ((WrapperStruct00.var_1_17 - 4) + ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))))) && (WrapperStruct00.var_1_18 == ((float) WrapperStruct00.var_1_8))) && (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_20 == ((unsigned char) WrapperStruct00.var_1_21)) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_3=183/20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 7, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 2136 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1328 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 292 IncrementalHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 808 mSDtfsCounter, 292 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=5, InterpolantAutomatonStates: 23, 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, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1031 NumberOfCodeBlocks, 1031 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 876 ConstructedInterpolants, 0 QuantifiedInterpolants, 988 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 4104/4104 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-13 06:24:54,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-10.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 b01652b30ec09a692ad6378ed531eb12202ad1b62f1f35df71071640dd6a83a1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:24:56,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:24:56,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:24:56,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:24:56,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:24:56,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:24:56,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:24:56,703 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:24:56,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:24:56,704 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:24:56,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:24:56,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:24:56,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:24:56,706 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:24:56,708 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:24:56,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:24:56,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:24:56,709 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:24:56,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:24:56,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:24:56,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:24:56,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:24:56,712 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:24:56,712 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:24:56,713 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:24:56,713 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:24:56,713 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:24:56,713 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:24:56,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:24:56,714 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:24:56,714 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:24:56,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:24:56,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:24:56,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:24:56,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:24:56,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:24:56,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:24:56,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:24:56,727 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:24:56,728 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:24:56,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:24:56,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:24:56,729 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:24:56,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:24:56,729 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:24:56,729 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 -> b01652b30ec09a692ad6378ed531eb12202ad1b62f1f35df71071640dd6a83a1 [2024-10-13 06:24:57,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:24:57,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:24:57,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:24:57,126 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:24:57,127 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:24:57,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-10.i [2024-10-13 06:24:58,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:24:59,096 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:24:59,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-10.i [2024-10-13 06:24:59,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99503e729/45a4bfaeabf843f3a0907130a88f92e6/FLAG6ff1af79d [2024-10-13 06:24:59,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99503e729/45a4bfaeabf843f3a0907130a88f92e6 [2024-10-13 06:24:59,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:24:59,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:24:59,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:24:59,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:24:59,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:24:59,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:24:59" (1/1) ... [2024-10-13 06:24:59,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5970d12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:59, skipping insertion in model container [2024-10-13 06:24:59,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:24:59" (1/1) ... [2024-10-13 06:24:59,186 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:24:59,392 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-10.i[916,929] [2024-10-13 06:24:59,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:24:59,509 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:24:59,521 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-10.i[916,929] [2024-10-13 06:24:59,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:24:59,627 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:24:59,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:59 WrapperNode [2024-10-13 06:24:59,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:24:59,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:24:59,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:24:59,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:24:59,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:59" (1/1) ... [2024-10-13 06:24:59,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:59" (1/1) ... [2024-10-13 06:24:59,718 INFO L138 Inliner]: procedures = 39, calls = 173, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 485 [2024-10-13 06:24:59,719 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:24:59,719 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:24:59,720 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:24:59,720 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:24:59,731 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:59" (1/1) ... [2024-10-13 06:24:59,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:59" (1/1) ... [2024-10-13 06:24:59,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:59" (1/1) ... [2024-10-13 06:24:59,790 INFO L175 MemorySlicer]: Split 142 memory accesses to 2 slices as follows [2, 140]. 99 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 18]. The 22 writes are split as follows [0, 22]. [2024-10-13 06:24:59,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:59" (1/1) ... [2024-10-13 06:24:59,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:59" (1/1) ... [2024-10-13 06:24:59,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:59" (1/1) ... [2024-10-13 06:24:59,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:59" (1/1) ... [2024-10-13 06:24:59,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:59" (1/1) ... [2024-10-13 06:24:59,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:59" (1/1) ... [2024-10-13 06:24:59,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:24:59,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:24:59,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:24:59,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:24:59,858 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:59" (1/1) ... [2024-10-13 06:24:59,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:24:59,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:24:59,901 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-13 06:24:59,908 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-13 06:24:59,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:24:59,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-13 06:24:59,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-13 06:24:59,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-13 06:24:59,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-13 06:24:59,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:24:59,965 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:24:59,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 06:24:59,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 06:24:59,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:24:59,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:24:59,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 06:24:59,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 06:24:59,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 06:24:59,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 06:24:59,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-13 06:24:59,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-13 06:24:59,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 06:24:59,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 06:24:59,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 06:24:59,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 06:24:59,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 06:24:59,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 06:24:59,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 06:24:59,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 06:24:59,970 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:24:59,970 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:24:59,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:24:59,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:24:59,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:24:59,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:24:59,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 06:24:59,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 06:24:59,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 06:24:59,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 06:25:00,145 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:25:00,147 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:25:01,601 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2024-10-13 06:25:01,602 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:25:01,664 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:25:01,666 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:25:01,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:25:01 BoogieIcfgContainer [2024-10-13 06:25:01,667 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:25:01,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:25:01,669 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:25:01,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:25:01,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:24:59" (1/3) ... [2024-10-13 06:25:01,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6101a466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:25:01, skipping insertion in model container [2024-10-13 06:25:01,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:24:59" (2/3) ... [2024-10-13 06:25:01,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6101a466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:25:01, skipping insertion in model container [2024-10-13 06:25:01,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:25:01" (3/3) ... [2024-10-13 06:25:01,678 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-10.i [2024-10-13 06:25:01,698 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:25:01,699 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:25:01,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:25:01,788 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;@49d08f10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:25:01,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:25:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 83 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:25:01,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 06:25:01,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:25:01,811 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:25:01,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:25:01,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:25:01,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1426010592, now seen corresponding path program 1 times [2024-10-13 06:25:01,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:25:01,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912945639] [2024-10-13 06:25:01,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:25:01,837 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-13 06:25:01,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:25:01,841 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-13 06:25:01,843 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-13 06:25:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:25:02,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:25:02,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:25:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-10-13 06:25:02,309 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:25:02,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:25:02,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912945639] [2024-10-13 06:25:02,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912945639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:25:02,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:25:02,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:25:02,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759420034] [2024-10-13 06:25:02,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:25:02,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:25:02,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:25:02,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:25:02,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:25:02,355 INFO L87 Difference]: Start difference. First operand has 104 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 83 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:25:02,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:25:02,447 INFO L93 Difference]: Finished difference Result 205 states and 325 transitions. [2024-10-13 06:25:02,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:25:02,450 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2024-10-13 06:25:02,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:25:02,457 INFO L225 Difference]: With dead ends: 205 [2024-10-13 06:25:02,457 INFO L226 Difference]: Without dead ends: 102 [2024-10-13 06:25:02,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 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-13 06:25:02,464 INFO L432 NwaCegarLoop]: 143 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, 143 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:25:02,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:25:02,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-13 06:25:02,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-13 06:25:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.345679012345679) internal successors, (109), 81 states have internal predecessors, (109), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:25:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 147 transitions. [2024-10-13 06:25:02,530 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 147 transitions. Word has length 147 [2024-10-13 06:25:02,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:25:02,531 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 147 transitions. [2024-10-13 06:25:02,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:25:02,531 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 147 transitions. [2024-10-13 06:25:02,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 06:25:02,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:25:02,535 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:25:02,549 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-13 06:25:02,739 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-13 06:25:02,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:25:02,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:25:02,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2089719354, now seen corresponding path program 1 times [2024-10-13 06:25:02,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:25:02,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751489055] [2024-10-13 06:25:02,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:25:02,746 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-13 06:25:02,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:25:02,750 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-13 06:25:02,752 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-13 06:25:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:25:03,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:25:03,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:25:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-10-13 06:25:03,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:25:03,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:25:03,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751489055] [2024-10-13 06:25:03,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751489055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:25:03,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:25:03,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:25:03,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505773942] [2024-10-13 06:25:03,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:25:03,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:25:03,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:25:03,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:25:03,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:25:03,252 INFO L87 Difference]: Start difference. First operand 102 states and 147 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:25:03,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:25:03,550 INFO L93 Difference]: Finished difference Result 205 states and 296 transitions. [2024-10-13 06:25:03,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:25:03,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2024-10-13 06:25:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:25:03,553 INFO L225 Difference]: With dead ends: 205 [2024-10-13 06:25:03,553 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 06:25:03,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 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-13 06:25:03,556 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:25:03,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 416 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:25:03,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 06:25:03,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-13 06:25:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:25:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2024-10-13 06:25:03,579 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 147 [2024-10-13 06:25:03,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:25:03,581 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2024-10-13 06:25:03,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:25:03,581 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2024-10-13 06:25:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 06:25:03,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:25:03,584 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:25:03,597 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-13 06:25:03,788 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-13 06:25:03,789 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:25:03,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:25:03,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1841781444, now seen corresponding path program 1 times [2024-10-13 06:25:03,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:25:03,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1520861442] [2024-10-13 06:25:03,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:25:03,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:25:03,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:25:03,795 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-13 06:25:03,797 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-13 06:25:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:25:04,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 06:25:04,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:25:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:25:04,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:25:04,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:25:04,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1520861442] [2024-10-13 06:25:04,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1520861442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:25:04,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:25:04,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:25:04,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190177739] [2024-10-13 06:25:04,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:25:04,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:25:04,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:25:04,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:25:04,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:25:04,230 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:25:04,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:25:04,561 INFO L93 Difference]: Finished difference Result 214 states and 307 transitions. [2024-10-13 06:25:04,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:25:04,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2024-10-13 06:25:04,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:25:04,569 INFO L225 Difference]: With dead ends: 214 [2024-10-13 06:25:04,569 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 06:25:04,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:25:04,575 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:25:04,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 668 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:25:04,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 06:25:04,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-10-13 06:25:04,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 89 states have internal predecessors, (117), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:25:04,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 155 transitions. [2024-10-13 06:25:04,599 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 155 transitions. Word has length 147 [2024-10-13 06:25:04,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:25:04,600 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 155 transitions. [2024-10-13 06:25:04,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:25:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 155 transitions. [2024-10-13 06:25:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 06:25:04,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:25:04,603 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:25:04,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 06:25:04,803 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-13 06:25:04,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:25:04,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:25:04,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1032434818, now seen corresponding path program 1 times [2024-10-13 06:25:04,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:25:04,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694512835] [2024-10-13 06:25:04,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:25:04,806 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-13 06:25:04,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:25:04,810 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-13 06:25:04,811 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-13 06:25:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:25:05,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 06:25:05,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:25:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:25:05,194 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:25:05,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:25:05,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694512835] [2024-10-13 06:25:05,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694512835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:25:05,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:25:05,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:25:05,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733319854] [2024-10-13 06:25:05,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:25:05,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:25:05,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:25:05,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:25:05,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:25:05,201 INFO L87 Difference]: Start difference. First operand 110 states and 155 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:25:05,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:25:05,795 INFO L93 Difference]: Finished difference Result 222 states and 313 transitions. [2024-10-13 06:25:05,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:25:05,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2024-10-13 06:25:05,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:25:05,800 INFO L225 Difference]: With dead ends: 222 [2024-10-13 06:25:05,800 INFO L226 Difference]: Without dead ends: 113 [2024-10-13 06:25:05,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:25:05,802 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:25:05,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 790 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:25:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-13 06:25:05,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-10-13 06:25:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:25:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2024-10-13 06:25:05,820 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 147 [2024-10-13 06:25:05,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:25:05,820 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2024-10-13 06:25:05,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:25:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2024-10-13 06:25:05,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 06:25:05,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:25:05,840 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:25:05,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 06:25:06,041 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-13 06:25:06,041 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:25:06,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:25:06,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1089693120, now seen corresponding path program 1 times [2024-10-13 06:25:06,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:25:06,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723552575] [2024-10-13 06:25:06,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:25:06,044 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-13 06:25:06,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:25:06,047 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-13 06:25:06,051 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-13 06:25:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:25:06,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 06:25:06,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:25:06,445 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:25:06,445 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:25:06,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:25:06,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723552575] [2024-10-13 06:25:06,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723552575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:25:06,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:25:06,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:25:06,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71265578] [2024-10-13 06:25:06,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:25:06,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:25:06,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:25:06,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:25:06,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:25:06,452 INFO L87 Difference]: Start difference. First operand 112 states and 157 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:25:06,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:25:06,757 INFO L93 Difference]: Finished difference Result 226 states and 317 transitions. [2024-10-13 06:25:06,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:25:06,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2024-10-13 06:25:06,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:25:06,760 INFO L225 Difference]: With dead ends: 226 [2024-10-13 06:25:06,760 INFO L226 Difference]: Without dead ends: 115 [2024-10-13 06:25:06,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:25:06,762 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:25:06,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 915 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:25:06,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-13 06:25:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-10-13 06:25:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3010752688172043) internal successors, (121), 93 states have internal predecessors, (121), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:25:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2024-10-13 06:25:06,772 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 147 [2024-10-13 06:25:06,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:25:06,773 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2024-10-13 06:25:06,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:25:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2024-10-13 06:25:06,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-13 06:25:06,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:25:06,776 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:25:06,788 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-13 06:25:06,979 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-13 06:25:06,980 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:25:06,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:25:06,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1089752702, now seen corresponding path program 1 times [2024-10-13 06:25:06,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:25:06,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123841669] [2024-10-13 06:25:06,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:25:06,982 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-13 06:25:06,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:25:06,985 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-13 06:25:06,987 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-13 06:25:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:25:07,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 06:25:07,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:25:07,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:07,430 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-13 06:25:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-10-13 06:25:07,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:25:07,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:25:07,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123841669] [2024-10-13 06:25:07,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123841669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:25:07,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:25:07,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:25:07,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306209483] [2024-10-13 06:25:07,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:25:07,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:25:07,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:25:07,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:25:07,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:25:07,486 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:25:09,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:25:09,302 INFO L93 Difference]: Finished difference Result 227 states and 317 transitions. [2024-10-13 06:25:09,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:25:09,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2024-10-13 06:25:09,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:25:09,305 INFO L225 Difference]: With dead ends: 227 [2024-10-13 06:25:09,305 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 06:25:09,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:25:09,306 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 137 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:25:09,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 399 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 06:25:09,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 06:25:09,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2024-10-13 06:25:09,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:25:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2024-10-13 06:25:09,315 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 147 [2024-10-13 06:25:09,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:25:09,316 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2024-10-13 06:25:09,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:25:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2024-10-13 06:25:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 06:25:09,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:25:09,318 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:25:09,330 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-13 06:25:09,518 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-13 06:25:09,519 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:25:09,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:25:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1380434554, now seen corresponding path program 1 times [2024-10-13 06:25:09,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:25:09,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115771369] [2024-10-13 06:25:09,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:25:09,520 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-13 06:25:09,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:25:09,522 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-13 06:25:09,523 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-13 06:25:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:25:09,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 06:25:09,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:25:10,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:10,004 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 172 treesize of output 64 [2024-10-13 06:25:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 192 proven. 8 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-10-13 06:25:10,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:25:10,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:10,362 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 110 treesize of output 1 [2024-10-13 06:25:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-13 06:25:10,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:25:10,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115771369] [2024-10-13 06:25:10,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115771369] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 06:25:10,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 06:25:10,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-10-13 06:25:10,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2245924] [2024-10-13 06:25:10,372 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 06:25:10,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:25:10,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:25:10,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:25:10,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:25:10,374 INFO L87 Difference]: Start difference. First operand 112 states and 156 transitions. Second operand has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 12 states have internal predecessors, (76), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2024-10-13 06:25:12,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:25:12,615 INFO L93 Difference]: Finished difference Result 236 states and 326 transitions. [2024-10-13 06:25:12,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 06:25:12,616 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 12 states have internal predecessors, (76), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) Word has length 149 [2024-10-13 06:25:12,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:25:12,617 INFO L225 Difference]: With dead ends: 236 [2024-10-13 06:25:12,617 INFO L226 Difference]: Without dead ends: 114 [2024-10-13 06:25:12,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-13 06:25:12,619 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 125 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:25:12,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 490 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 06:25:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-13 06:25:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2024-10-13 06:25:12,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 91 states have internal predecessors, (116), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:25:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 154 transitions. [2024-10-13 06:25:12,629 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 154 transitions. Word has length 149 [2024-10-13 06:25:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:25:12,629 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 154 transitions. [2024-10-13 06:25:12,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.909090909090909) internal successors, (76), 12 states have internal predecessors, (76), 4 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 4 states have call successors, (37) [2024-10-13 06:25:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 154 transitions. [2024-10-13 06:25:12,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-13 06:25:12,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:25:12,631 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:25:12,645 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 (8)] Forceful destruction successful, exit code 0 [2024-10-13 06:25:12,832 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-13 06:25:12,833 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:25:12,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:25:12,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1515579140, now seen corresponding path program 1 times [2024-10-13 06:25:12,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:25:12,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286149942] [2024-10-13 06:25:12,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:25:12,835 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-13 06:25:12,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:25:12,836 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-13 06:25:12,837 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-13 06:25:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:25:13,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 06:25:13,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:25:13,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:13,237 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-13 06:25:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2024-10-13 06:25:13,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:25:13,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:25:13,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286149942] [2024-10-13 06:25:13,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286149942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:25:13,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:25:13,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:25:13,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947207276] [2024-10-13 06:25:13,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:25:13,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:25:13,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:25:13,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:25:13,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:25:13,275 INFO L87 Difference]: Start difference. First operand 112 states and 154 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:25:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:25:14,644 INFO L93 Difference]: Finished difference Result 224 states and 308 transitions. [2024-10-13 06:25:14,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:25:14,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2024-10-13 06:25:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:25:14,646 INFO L225 Difference]: With dead ends: 224 [2024-10-13 06:25:14,646 INFO L226 Difference]: Without dead ends: 113 [2024-10-13 06:25:14,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 144 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-13 06:25:14,647 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 125 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:25:14,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 387 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 06:25:14,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-13 06:25:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-10-13 06:25:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.2637362637362637) internal successors, (115), 91 states have internal predecessors, (115), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:25:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 153 transitions. [2024-10-13 06:25:14,656 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 153 transitions. Word has length 149 [2024-10-13 06:25:14,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:25:14,657 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 153 transitions. [2024-10-13 06:25:14,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:25:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 153 transitions. [2024-10-13 06:25:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-13 06:25:14,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:25:14,659 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:25:14,674 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-13 06:25:14,860 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-13 06:25:14,861 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:25:14,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:25:14,861 INFO L85 PathProgramCache]: Analyzing trace with hash -802414018, now seen corresponding path program 1 times [2024-10-13 06:25:14,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:25:14,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204241316] [2024-10-13 06:25:14,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:25:14,862 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-13 06:25:14,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:25:14,864 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-13 06:25:14,865 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-13 06:25:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:25:15,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 06:25:15,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:25:15,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-13 06:25:15,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:15,489 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 54 treesize of output 57 [2024-10-13 06:25:15,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:15,635 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 63 treesize of output 77 [2024-10-13 06:25:15,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:15,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 91 treesize of output 105 [2024-10-13 06:25:15,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:15,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 117 treesize of output 108 [2024-10-13 06:25:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:25:15,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:25:15,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:25:15,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204241316] [2024-10-13 06:25:15,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204241316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:25:15,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:25:15,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:25:15,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663541968] [2024-10-13 06:25:15,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:25:15,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:25:15,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:25:15,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:25:15,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:25:15,999 INFO L87 Difference]: Start difference. First operand 112 states and 153 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:25:19,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:25:19,590 INFO L93 Difference]: Finished difference Result 265 states and 361 transitions. [2024-10-13 06:25:19,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:25:19,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2024-10-13 06:25:19,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:25:19,593 INFO L225 Difference]: With dead ends: 265 [2024-10-13 06:25:19,593 INFO L226 Difference]: Without dead ends: 154 [2024-10-13 06:25:19,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:25:19,597 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 136 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:25:19,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 323 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-13 06:25:19,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-13 06:25:19,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 110. [2024-10-13 06:25:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 89 states have internal predecessors, (112), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:25:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 150 transitions. [2024-10-13 06:25:19,614 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 150 transitions. Word has length 151 [2024-10-13 06:25:19,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:25:19,615 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 150 transitions. [2024-10-13 06:25:19,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:25:19,615 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 150 transitions. [2024-10-13 06:25:19,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-13 06:25:19,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:25:19,617 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:25:19,636 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-13 06:25:19,820 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-13 06:25:19,820 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:25:19,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:25:19,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1658805725, now seen corresponding path program 1 times [2024-10-13 06:25:19,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:25:19,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898239868] [2024-10-13 06:25:19,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:25:19,826 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-13 06:25:19,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:25:19,829 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-13 06:25:19,831 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-13 06:25:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:25:20,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 06:25:20,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:25:20,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 06:25:20,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2024-10-13 06:25:20,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:20,412 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 139 treesize of output 55 [2024-10-13 06:25:20,454 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:25:20,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:25:20,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:25:20,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898239868] [2024-10-13 06:25:20,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898239868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:25:20,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:25:20,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:25:20,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211478779] [2024-10-13 06:25:20,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:25:20,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:25:20,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:25:20,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:25:20,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:25:20,458 INFO L87 Difference]: Start difference. First operand 110 states and 150 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:25:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:25:23,796 INFO L93 Difference]: Finished difference Result 331 states and 452 transitions. [2024-10-13 06:25:23,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:25:23,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-10-13 06:25:23,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:25:23,806 INFO L225 Difference]: With dead ends: 331 [2024-10-13 06:25:23,806 INFO L226 Difference]: Without dead ends: 222 [2024-10-13 06:25:23,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:25:23,808 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 123 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:25:23,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 791 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-13 06:25:23,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-13 06:25:23,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 116. [2024-10-13 06:25:23,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:25:23,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 157 transitions. [2024-10-13 06:25:23,827 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 157 transitions. Word has length 153 [2024-10-13 06:25:23,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:25:23,829 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 157 transitions. [2024-10-13 06:25:23,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:25:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2024-10-13 06:25:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-13 06:25:23,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:25:23,831 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:25:23,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 06:25:24,032 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-13 06:25:24,032 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:25:24,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:25:24,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1782049527, now seen corresponding path program 1 times [2024-10-13 06:25:24,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:25:24,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49931570] [2024-10-13 06:25:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:25:24,035 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-13 06:25:24,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:25:24,036 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-13 06:25:24,044 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-13 06:25:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:25:24,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 06:25:24,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:25:24,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:24,677 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 32 treesize of output 35 [2024-10-13 06:25:24,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:24,791 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 73 treesize of output 49 [2024-10-13 06:25:24,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:24,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 59 treesize of output 21 [2024-10-13 06:25:25,218 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:25:25,218 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:25:25,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:25:25,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49931570] [2024-10-13 06:25:25,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49931570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:25:25,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:25:25,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:25:25,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041301652] [2024-10-13 06:25:25,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:25:25,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:25:25,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:25:25,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:25:25,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:25:25,221 INFO L87 Difference]: Start difference. First operand 116 states and 157 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:25:37,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:25:37,688 INFO L93 Difference]: Finished difference Result 391 states and 523 transitions. [2024-10-13 06:25:37,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:25:37,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2024-10-13 06:25:37,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:25:37,692 INFO L225 Difference]: With dead ends: 391 [2024-10-13 06:25:37,692 INFO L226 Difference]: Without dead ends: 276 [2024-10-13 06:25:37,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:25:37,693 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 170 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:25:37,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 678 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2024-10-13 06:25:37,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-13 06:25:37,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 199. [2024-10-13 06:25:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 168 states have (on average 1.255952380952381) internal successors, (211), 169 states have internal predecessors, (211), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 06:25:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 267 transitions. [2024-10-13 06:25:37,727 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 267 transitions. Word has length 154 [2024-10-13 06:25:37,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:25:37,727 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 267 transitions. [2024-10-13 06:25:37,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:25:37,728 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 267 transitions. [2024-10-13 06:25:37,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-13 06:25:37,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:25:37,730 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:25:37,754 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 (12)] Ended with exit code 0 [2024-10-13 06:25:37,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:25:37,931 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:25:37,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:25:37,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1733173303, now seen corresponding path program 1 times [2024-10-13 06:25:37,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:25:37,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1324864974] [2024-10-13 06:25:37,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:25:37,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-13 06:25:37,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:25:37,937 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:25:37,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 06:25:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:25:38,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 06:25:38,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:25:38,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:38,620 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 32 treesize of output 35 [2024-10-13 06:25:38,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:38,711 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 72 treesize of output 48 [2024-10-13 06:25:38,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:38,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 71 treesize of output 27 [2024-10-13 06:25:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:25:39,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:25:39,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:25:39,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1324864974] [2024-10-13 06:25:39,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1324864974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:25:39,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:25:39,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:25:39,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826286741] [2024-10-13 06:25:39,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:25:39,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:25:39,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:25:39,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:25:39,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:25:39,157 INFO L87 Difference]: Start difference. First operand 199 states and 267 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:25:50,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:25:50,330 INFO L93 Difference]: Finished difference Result 467 states and 623 transitions. [2024-10-13 06:25:50,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:25:50,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2024-10-13 06:25:50,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:25:50,334 INFO L225 Difference]: With dead ends: 467 [2024-10-13 06:25:50,334 INFO L226 Difference]: Without dead ends: 269 [2024-10-13 06:25:50,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:25:50,335 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 189 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:25:50,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 547 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2024-10-13 06:25:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-10-13 06:25:50,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 199. [2024-10-13 06:25:50,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 168 states have (on average 1.25) internal successors, (210), 169 states have internal predecessors, (210), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 06:25:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 266 transitions. [2024-10-13 06:25:50,361 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 266 transitions. Word has length 155 [2024-10-13 06:25:50,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:25:50,364 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 266 transitions. [2024-10-13 06:25:50,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:25:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 266 transitions. [2024-10-13 06:25:50,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-13 06:25:50,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:25:50,369 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 06:25:50,393 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 (13)] Ended with exit code 0 [2024-10-13 06:25:50,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:25:50,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:25:50,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:25:50,570 INFO L85 PathProgramCache]: Analyzing trace with hash 88617263, now seen corresponding path program 1 times [2024-10-13 06:25:50,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:25:50,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512079218] [2024-10-13 06:25:50,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:25:50,571 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-13 06:25:50,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:25:50,572 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:25:50,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 06:25:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:25:51,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-13 06:25:51,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:25:51,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 10 [2024-10-13 06:25:52,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:52,336 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 142 treesize of output 63 [2024-10-13 06:25:52,647 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:52,648 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 137 treesize of output 73 [2024-10-13 06:25:53,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:53,106 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 152 treesize of output 76 [2024-10-13 06:25:53,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:53,503 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 152 treesize of output 76 [2024-10-13 06:25:53,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:53,912 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 152 treesize of output 76 [2024-10-13 06:25:54,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:54,159 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 152 treesize of output 76 [2024-10-13 06:25:54,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:54,434 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 147 treesize of output 86 [2024-10-13 06:25:54,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:54,811 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 161 treesize of output 95 [2024-10-13 06:25:54,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:54,908 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 128 treesize of output 106 [2024-10-13 06:25:55,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:55,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 156 treesize of output 143 [2024-10-13 06:25:55,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:55,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 229 treesize of output 187 [2024-10-13 06:25:55,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:25:55,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 422 treesize of output 170 [2024-10-13 06:25:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 224 proven. 240 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 06:25:56,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 06:25:56,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:25:56,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512079218] [2024-10-13 06:25:56,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512079218] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 06:25:56,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1869323073] [2024-10-13 06:25:56,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:25:56,597 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 06:25:56,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 06:25:56,599 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 06:25:56,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-10-13 06:26:00,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:26:00,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-13 06:26:00,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:26:00,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-13 06:26:02,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:02,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 71 [2024-10-13 06:26:03,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:03,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 82 [2024-10-13 06:26:03,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:03,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 53 [2024-10-13 06:26:04,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:04,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 56 [2024-10-13 06:26:04,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:04,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 56 [2024-10-13 06:26:05,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:05,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 56 [2024-10-13 06:26:05,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:05,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 56 treesize of output 56 [2024-10-13 06:26:06,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:06,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 55 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 81 treesize of output 95 [2024-10-13 06:26:06,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:06,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 88 treesize of output 114 [2024-10-13 06:26:07,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:07,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 78 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 110 treesize of output 138 [2024-10-13 06:26:08,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:26:08,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 105 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 164 treesize of output 179