./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-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 7b11f141aa22d48b7e7ff171fdd1055547e38349c2a3aa09d0322e32e2567512 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:51:32,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:51:32,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:51:32,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:51:32,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:51:32,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:51:32,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:51:32,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:51:32,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:51:32,939 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:51:32,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:51:32,940 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:51:32,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:51:32,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:51:32,942 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:51:32,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:51:32,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:51:32,943 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:51:32,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:51:32,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:51:32,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:51:32,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:51:32,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:51:32,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:51:32,946 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:51:32,946 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:51:32,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:51:32,946 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:51:32,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:51:32,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:51:32,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:51:32,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:51:32,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:51:32,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:51:32,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:51:32,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:51:32,948 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:51:32,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:51:32,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:51:32,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:51:32,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:51:32,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:51:32,950 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-clean/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-clean/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 -> 7b11f141aa22d48b7e7ff171fdd1055547e38349c2a3aa09d0322e32e2567512 [2024-10-11 13:51:33,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:51:33,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:51:33,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:51:33,189 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:51:33,189 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:51:33,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i [2024-10-11 13:51:34,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:51:34,788 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:51:34,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i [2024-10-11 13:51:34,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c6a524875/bd595cfd946d42e7a139116dc1b150d9/FLAG646df8636 [2024-10-11 13:51:34,815 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c6a524875/bd595cfd946d42e7a139116dc1b150d9 [2024-10-11 13:51:34,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:51:34,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:51:34,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:51:34,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:51:34,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:51:34,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:51:34" (1/1) ... [2024-10-11 13:51:34,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581fe133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:34, skipping insertion in model container [2024-10-11 13:51:34,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:51:34" (1/1) ... [2024-10-11 13:51:34,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:51:35,000 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-68.i[916,929] [2024-10-11 13:51:35,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:51:35,073 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:51:35,084 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-68.i[916,929] [2024-10-11 13:51:35,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:51:35,181 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:51:35,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:35 WrapperNode [2024-10-11 13:51:35,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:51:35,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:51:35,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:51:35,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:51:35,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:35" (1/1) ... [2024-10-11 13:51:35,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:35" (1/1) ... [2024-10-11 13:51:35,266 INFO L138 Inliner]: procedures = 29, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 508 [2024-10-11 13:51:35,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:51:35,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:51:35,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:51:35,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:51:35,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:35" (1/1) ... [2024-10-11 13:51:35,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:35" (1/1) ... [2024-10-11 13:51:35,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:35" (1/1) ... [2024-10-11 13:51:35,296 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 19 initializations are split as follows [2, 17]. The 20 writes are split as follows [0, 20]. [2024-10-11 13:51:35,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:35" (1/1) ... [2024-10-11 13:51:35,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:35" (1/1) ... [2024-10-11 13:51:35,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:35" (1/1) ... [2024-10-11 13:51:35,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:35" (1/1) ... [2024-10-11 13:51:35,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:35" (1/1) ... [2024-10-11 13:51:35,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:35" (1/1) ... [2024-10-11 13:51:35,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:51:35,321 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:51:35,321 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:51:35,321 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:51:35,322 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:35" (1/1) ... [2024-10-11 13:51:35,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:51:35,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:51:35,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:51:35,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:51:35,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:51:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:51:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:51:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:51:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:51:35,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:51:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:51:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:51:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:51:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:51:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:51:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:51:35,407 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:51:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:51:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:51:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:51:35,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:51:35,497 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:51:35,499 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:51:35,869 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-11 13:51:35,870 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:51:35,897 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:51:35,898 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:51:35,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:51:35 BoogieIcfgContainer [2024-10-11 13:51:35,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:51:35,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:51:35,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:51:35,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:51:35,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:51:34" (1/3) ... [2024-10-11 13:51:35,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384ba514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:51:35, skipping insertion in model container [2024-10-11 13:51:35,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:35" (2/3) ... [2024-10-11 13:51:35,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384ba514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:51:35, skipping insertion in model container [2024-10-11 13:51:35,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:51:35" (3/3) ... [2024-10-11 13:51:35,905 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-68.i [2024-10-11 13:51:35,918 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:51:35,919 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:51:35,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:51:35,984 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;@39ae4878, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:51:35,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:51:35,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:36,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 13:51:36,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:36,005 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:36,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:36,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:36,011 INFO L85 PathProgramCache]: Analyzing trace with hash 48315247, now seen corresponding path program 1 times [2024-10-11 13:51:36,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:36,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551643485] [2024-10-11 13:51:36,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:36,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:51:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:51:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:51:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:51:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:51:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:51:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:51:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:51:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:51:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:51:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:51:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:51:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:51:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:51:36,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:51:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:51:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:51:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:51:36,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:51:36,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551643485] [2024-10-11 13:51:36,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551643485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:36,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:36,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:51:36,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678948356] [2024-10-11 13:51:36,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:36,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:51:36,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:51:36,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:51:36,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:51:36,373 INFO L87 Difference]: Start difference. First operand has 107 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:51:36,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:36,405 INFO L93 Difference]: Finished difference Result 211 states and 335 transitions. [2024-10-11 13:51:36,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:51:36,408 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2024-10-11 13:51:36,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:36,414 INFO L225 Difference]: With dead ends: 211 [2024-10-11 13:51:36,414 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 13:51:36,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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-11 13:51:36,422 INFO L432 NwaCegarLoop]: 151 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, 151 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-11 13:51:36,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:51:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 13:51:36,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-11 13:51:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:36,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2024-10-11 13:51:36,511 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 141 [2024-10-11 13:51:36,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:36,513 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2024-10-11 13:51:36,513 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:51:36,514 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2024-10-11 13:51:36,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 13:51:36,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:36,518 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:36,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:51:36,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:36,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:36,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1693884809, now seen corresponding path program 1 times [2024-10-11 13:51:36,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:36,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337582080] [2024-10-11 13:51:36,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:36,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:51:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:51:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:51:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:51:36,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:51:36,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:51:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:51:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:51:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:51:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:51:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:51:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:51:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:51:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:51:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:51:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:51:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:51:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:36,927 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:51:36,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:51:36,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337582080] [2024-10-11 13:51:36,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337582080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:36,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:36,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:51:36,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489874529] [2024-10-11 13:51:36,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:36,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:51:36,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:51:36,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:51:36,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:51:36,933 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:36,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:36,993 INFO L93 Difference]: Finished difference Result 212 states and 313 transitions. [2024-10-11 13:51:36,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:51:36,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2024-10-11 13:51:36,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:36,997 INFO L225 Difference]: With dead ends: 212 [2024-10-11 13:51:36,997 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 13:51:36,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:51:37,000 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:37,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 583 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:51:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 13:51:37,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-11 13:51:37,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 158 transitions. [2024-10-11 13:51:37,016 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 158 transitions. Word has length 141 [2024-10-11 13:51:37,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:37,019 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 158 transitions. [2024-10-11 13:51:37,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 158 transitions. [2024-10-11 13:51:37,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 13:51:37,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:37,021 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:37,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:51:37,022 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:37,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:37,022 INFO L85 PathProgramCache]: Analyzing trace with hash -774864519, now seen corresponding path program 1 times [2024-10-11 13:51:37,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:37,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683342364] [2024-10-11 13:51:37,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:37,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:51:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:51:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:51:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:51:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:51:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:51:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:51:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:51:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:51:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:51:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:51:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:51:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:51:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:51:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:51:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:51:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:51:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:51:37,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:51:37,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683342364] [2024-10-11 13:51:37,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683342364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:37,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:37,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:51:37,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180687170] [2024-10-11 13:51:37,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:37,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:51:37,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:51:37,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:51:37,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:51:37,333 INFO L87 Difference]: Start difference. First operand 108 states and 158 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:37,385 INFO L93 Difference]: Finished difference Result 218 states and 319 transitions. [2024-10-11 13:51:37,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:51:37,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2024-10-11 13:51:37,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:37,387 INFO L225 Difference]: With dead ends: 218 [2024-10-11 13:51:37,390 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 13:51:37,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:51:37,391 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:37,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 588 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:51:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 13:51:37,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-10-11 13:51:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2024-10-11 13:51:37,405 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 141 [2024-10-11 13:51:37,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:37,405 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2024-10-11 13:51:37,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2024-10-11 13:51:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 13:51:37,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:37,407 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:37,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:51:37,411 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:37,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:37,411 INFO L85 PathProgramCache]: Analyzing trace with hash -597135420, now seen corresponding path program 1 times [2024-10-11 13:51:37,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:37,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627765630] [2024-10-11 13:51:37,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:37,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:51:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:51:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:51:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:51:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:51:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:51:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:51:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:51:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:51:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:51:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:51:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:51:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:51:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:51:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:51:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:51:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:51:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:51:37,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:51:37,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627765630] [2024-10-11 13:51:37,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627765630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:37,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:37,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:51:37,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102458349] [2024-10-11 13:51:37,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:37,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:51:37,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:51:37,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:51:37,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:51:37,566 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:37,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:37,600 INFO L93 Difference]: Finished difference Result 220 states and 321 transitions. [2024-10-11 13:51:37,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:51:37,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-10-11 13:51:37,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:37,602 INFO L225 Difference]: With dead ends: 220 [2024-10-11 13:51:37,602 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 13:51:37,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-11 13:51:37,603 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:37,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 437 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:51:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 13:51:37,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-10-11 13:51:37,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 92 states have (on average 1.3804347826086956) internal successors, (127), 92 states have internal predecessors, (127), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2024-10-11 13:51:37,639 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 143 [2024-10-11 13:51:37,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:37,639 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2024-10-11 13:51:37,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:37,640 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2024-10-11 13:51:37,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 13:51:37,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:37,643 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:37,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:51:37,643 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:37,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:37,643 INFO L85 PathProgramCache]: Analyzing trace with hash -990162430, now seen corresponding path program 1 times [2024-10-11 13:51:37,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:37,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109270677] [2024-10-11 13:51:37,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:37,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:51:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:51:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:51:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:51:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:51:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:51:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:51:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:51:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:51:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:51:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:51:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:51:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:51:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:51:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:51:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:51:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:51:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,778 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:51:37,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:51:37,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109270677] [2024-10-11 13:51:37,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109270677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:37,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:37,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:51:37,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051711656] [2024-10-11 13:51:37,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:37,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:51:37,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:51:37,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:51:37,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:51:37,783 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:37,811 INFO L93 Difference]: Finished difference Result 224 states and 325 transitions. [2024-10-11 13:51:37,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:51:37,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-10-11 13:51:37,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:37,814 INFO L225 Difference]: With dead ends: 224 [2024-10-11 13:51:37,814 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 13:51:37,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-11 13:51:37,815 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 438 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-11 13:51:37,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 438 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:51:37,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 13:51:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-11 13:51:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.372340425531915) internal successors, (129), 94 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2024-10-11 13:51:37,826 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 143 [2024-10-11 13:51:37,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:37,826 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2024-10-11 13:51:37,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2024-10-11 13:51:37,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 13:51:37,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:37,828 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:37,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:51:37,829 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:37,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:37,830 INFO L85 PathProgramCache]: Analyzing trace with hash -932904128, now seen corresponding path program 1 times [2024-10-11 13:51:37,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:37,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242214685] [2024-10-11 13:51:37,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:37,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:51:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:51:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:51:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:51:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:51:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:51:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:51:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:51:37,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:51:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:51:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:51:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:51:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:51:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:51:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:51:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:51:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:51:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:51:37,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:51:37,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242214685] [2024-10-11 13:51:37,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242214685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:37,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:37,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:51:37,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767668199] [2024-10-11 13:51:37,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:37,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:51:37,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:51:37,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:51:37,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:51:37,942 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:37,966 INFO L93 Difference]: Finished difference Result 228 states and 329 transitions. [2024-10-11 13:51:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:51:37,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-10-11 13:51:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:37,967 INFO L225 Difference]: With dead ends: 228 [2024-10-11 13:51:37,968 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 13:51:37,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 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-11 13:51:37,970 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 441 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-11 13:51:37,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 441 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:51:37,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 13:51:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-10-11 13:51:37,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 96 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 165 transitions. [2024-10-11 13:51:37,977 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 165 transitions. Word has length 143 [2024-10-11 13:51:37,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:37,978 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 165 transitions. [2024-10-11 13:51:37,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 165 transitions. [2024-10-11 13:51:37,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 13:51:37,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:37,983 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:37,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:51:37,983 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:37,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:37,983 INFO L85 PathProgramCache]: Analyzing trace with hash -932844546, now seen corresponding path program 1 times [2024-10-11 13:51:37,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:37,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051425870] [2024-10-11 13:51:37,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:37,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:38,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:51:38,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:38,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:51:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:38,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:51:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:38,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:51:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:38,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:51:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:38,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:51:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:38,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:51:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:38,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:51:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:38,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:51:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:38,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:51:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:38,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:51:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:38,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:51:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:38,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:51:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:38,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:51:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:38,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:51:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:38,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:51:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:38,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:51:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:51:38,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:51:38,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051425870] [2024-10-11 13:51:38,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051425870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:38,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:38,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:51:38,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528101420] [2024-10-11 13:51:38,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:38,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:51:38,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:51:38,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:51:38,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:51:38,251 INFO L87 Difference]: Start difference. First operand 115 states and 165 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:38,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:38,263 INFO L93 Difference]: Finished difference Result 229 states and 329 transitions. [2024-10-11 13:51:38,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:51:38,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-10-11 13:51:38,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:38,264 INFO L225 Difference]: With dead ends: 229 [2024-10-11 13:51:38,264 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 13:51:38,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:51:38,265 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:38,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:51:38,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 13:51:38,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-11 13:51:38,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 96 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2024-10-11 13:51:38,270 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 143 [2024-10-11 13:51:38,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:38,270 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2024-10-11 13:51:38,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:38,270 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2024-10-11 13:51:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 13:51:38,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:38,271 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:38,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:51:38,272 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:38,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:38,272 INFO L85 PathProgramCache]: Analyzing trace with hash -792295936, now seen corresponding path program 1 times [2024-10-11 13:51:38,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:51:38,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487047811] [2024-10-11 13:51:38,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:38,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:51:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:51:38,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [185561983] [2024-10-11 13:51:38,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:38,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:51:38,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:51:38,379 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:51:38,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:51:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:51:38,715 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:51:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:51:39,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:51:39,002 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:51:39,003 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:51:39,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:51:39,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:51:39,214 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:51:39,285 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:51:39,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:51:39 BoogieIcfgContainer [2024-10-11 13:51:39,290 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:51:39,290 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:51:39,290 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:51:39,290 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:51:39,291 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:51:35" (3/4) ... [2024-10-11 13:51:39,292 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:51:39,293 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:51:39,293 INFO L158 Benchmark]: Toolchain (without parser) took 4474.35ms. Allocated memory was 165.7MB in the beginning and 306.2MB in the end (delta: 140.5MB). Free memory was 92.3MB in the beginning and 104.0MB in the end (delta: -11.6MB). Peak memory consumption was 129.7MB. Max. memory is 16.1GB. [2024-10-11 13:51:39,293 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:51:39,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.00ms. Allocated memory is still 165.7MB. Free memory was 92.2MB in the beginning and 133.3MB in the end (delta: -41.1MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-10-11 13:51:39,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.10ms. Allocated memory was 165.7MB in the beginning and 218.1MB in the end (delta: 52.4MB). Free memory was 133.2MB in the beginning and 186.2MB in the end (delta: -52.9MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2024-10-11 13:51:39,294 INFO L158 Benchmark]: Boogie Preprocessor took 53.10ms. Allocated memory is still 218.1MB. Free memory was 186.2MB in the beginning and 182.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:51:39,294 INFO L158 Benchmark]: RCFGBuilder took 577.45ms. Allocated memory is still 218.1MB. Free memory was 180.9MB in the beginning and 144.2MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-11 13:51:39,295 INFO L158 Benchmark]: TraceAbstraction took 3389.54ms. Allocated memory was 218.1MB in the beginning and 306.2MB in the end (delta: 88.1MB). Free memory was 143.2MB in the beginning and 105.0MB in the end (delta: 38.2MB). Peak memory consumption was 127.3MB. Max. memory is 16.1GB. [2024-10-11 13:51:39,295 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 306.2MB. Free memory was 105.0MB in the beginning and 104.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:51:39,296 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.14ms. Allocated memory is still 165.7MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.00ms. Allocated memory is still 165.7MB. Free memory was 92.2MB in the beginning and 133.3MB in the end (delta: -41.1MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.10ms. Allocated memory was 165.7MB in the beginning and 218.1MB in the end (delta: 52.4MB). Free memory was 133.2MB in the beginning and 186.2MB in the end (delta: -52.9MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.10ms. Allocated memory is still 218.1MB. Free memory was 186.2MB in the beginning and 182.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 577.45ms. Allocated memory is still 218.1MB. Free memory was 180.9MB in the beginning and 144.2MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3389.54ms. Allocated memory was 218.1MB in the beginning and 306.2MB in the end (delta: 88.1MB). Free memory was 143.2MB in the beginning and 105.0MB in the end (delta: 38.2MB). Peak memory consumption was 127.3MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 306.2MB. Free memory was 105.0MB in the beginning and 104.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 129. Possible FailurePath: [L41] unsigned char isInitial = 0; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 32, 64.5, 16.8, 10, 0, 25.5, 9999999999999.729, 999.8, -25, -64, 0, -8, 5, 0, 8, 32.375, -10 }; [L61] signed short int last_1_WrapperStruct00_var_1_13 = -25; [L62] signed long int last_1_WrapperStruct00_var_1_17 = 5; [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] CALL updateLastVariables() [L125] EXPR WrapperStruct00.var_1_13 [L125] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L126] EXPR WrapperStruct00.var_1_17 [L126] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L136] RET updateLastVariables() [L137] CALL updateVariables() [L96] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L97] EXPR WrapperStruct00.var_1_2 [L97] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L97] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_2 [L97] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L97] EXPR (WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L97] EXPR (WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L98] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L99] EXPR WrapperStruct00.var_1_3 [L99] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L99] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_3 [L99] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L99] EXPR (WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L99] EXPR (WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L100] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L101] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -2147483648) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -2147483648) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L102] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L103] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_8 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_8 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L104] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L107] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L108] EXPR WrapperStruct00.var_1_11 [L108] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L108] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_11 [L108] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L108] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L108] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L109] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L110] EXPR WrapperStruct00.var_1_12 [L110] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L110] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_12 [L110] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L110] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L110] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L111] WrapperStruct00.var_1_14 = __VERIFIER_nondet_short() [L112] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -8191) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L113] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 8192) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 8192) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L114] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L115] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -8191) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L116] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 8191) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L117] WrapperStruct00.var_1_16 = __VERIFIER_nondet_short() [L118] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L119] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L120] WrapperStruct00.var_1_19 = __VERIFIER_nondet_ulong() [L121] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L122] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L137] RET updateVariables() [L138] CALL step() [L66] EXPR WrapperStruct00.var_1_8 [L66] signed long int stepLocal_2 = WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17; [L67] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L67] COND FALSE !(WrapperStruct00.var_1_9) [L74] EXPR WrapperStruct00.var_1_15 [L74] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_15 [L76] EXPR WrapperStruct00.var_1_13 [L76] EXPR WrapperStruct00.var_1_14 [L76] WrapperStruct00.var_1_17 = (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14) [L77] EXPR WrapperStruct00.var_1_19 [L77] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L78] EXPR WrapperStruct00.var_1_12 [L78] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_12 [L79] EXPR WrapperStruct00.var_1_17 [L79] WrapperStruct00.var_1_21 = WrapperStruct00.var_1_17 [L80] EXPR WrapperStruct00.var_1_17 [L80] signed long int stepLocal_1 = WrapperStruct00.var_1_17; [L81] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L81] COND FALSE !(stepLocal_1 != WrapperStruct00.var_1_21) [L84] EXPR WrapperStruct00.var_1_18 [L84] EXPR WrapperStruct00.var_1_21 [L84] unsigned long int stepLocal_0 = WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21; [L85] EXPR WrapperStruct00.var_1_2 [L85] EXPR WrapperStruct00.var_1_3 [L85] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L85] COND FALSE !((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) [L90] WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L90] COND FALSE !(WrapperStruct00.var_1_9) [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR WrapperStruct00.var_1_2 [L129] EXPR WrapperStruct00.var_1_3 [L129] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1) [L129] EXPR WrapperStruct00.var_1_18 [L129] EXPR WrapperStruct00.var_1_21 [L129] EXPR WrapperStruct00.var_1_13 [L129] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1 [L129] EXPR WrapperStruct00.var_1_1 [L129] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21) [L129] EXPR WrapperStruct00.var_1_21 [L129] EXPR ((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR (((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR (((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR (((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR (((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR (((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR (((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_12)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_21 == ((signed long int) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129] EXPR ((((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_21 == ((signed long int) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L129-L130] return ((((((((WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) >= WrapperStruct00.var_1_10) ? (((WrapperStruct00.var_1_18 + WrapperStruct00.var_1_21) >= (WrapperStruct00.var_1_13 / WrapperStruct00.var_1_8)) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) < 0 ) ? -(WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_21))))) : 1) : (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((signed long int) ((((WrapperStruct00.var_1_21) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_21) : (WrapperStruct00.var_1_18))))) : 1)) && ((WrapperStruct00.var_1_17 != WrapperStruct00.var_1_21) ? (WrapperStruct00.var_1_10 == ((double) (WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12))) : 1)) && (WrapperStruct00.var_1_9 ? ((last_1_WrapperStruct00_var_1_13 <= (WrapperStruct00.var_1_8 + last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((WrapperStruct00.var_1_14 + WrapperStruct00.var_1_15) + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_13 == ((signed short int) WrapperStruct00.var_1_15)))) && (WrapperStruct00.var_1_17 == ((signed long int) (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_14)))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_12))) && (WrapperStruct00.var_1_21 == ((signed long int) WrapperStruct00.var_1_17)) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=-25, last_1_WrapperStruct00_var_1_17=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 8, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 2934 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1891 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1043 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=6, InterpolantAutomatonStates: 27, 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, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1281 NumberOfCodeBlocks, 1281 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 988 ConstructedInterpolants, 0 QuantifiedInterpolants, 1008 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 3808/3808 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-11 13:51:39,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 7b11f141aa22d48b7e7ff171fdd1055547e38349c2a3aa09d0322e32e2567512 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:51:41,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:51:41,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:51:41,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:51:41,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:51:41,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:51:41,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:51:41,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:51:41,433 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:51:41,434 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:51:41,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:51:41,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:51:41,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:51:41,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:51:41,438 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:51:41,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:51:41,438 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:51:41,438 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:51:41,439 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:51:41,439 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:51:41,439 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:51:41,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:51:41,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:51:41,440 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:51:41,440 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:51:41,441 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:51:41,441 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:51:41,441 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:51:41,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:51:41,441 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:51:41,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:51:41,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:51:41,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:51:41,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:51:41,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:51:41,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:51:41,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:51:41,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:51:41,444 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:51:41,444 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:51:41,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:51:41,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:51:41,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:51:41,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:51:41,445 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:51:41,445 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-clean/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-clean/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 -> 7b11f141aa22d48b7e7ff171fdd1055547e38349c2a3aa09d0322e32e2567512 [2024-10-11 13:51:41,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:51:41,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:51:41,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:51:41,743 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:51:41,744 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:51:41,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i [2024-10-11 13:51:43,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:51:43,356 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:51:43,357 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-68.i [2024-10-11 13:51:43,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/32d8c0fa4/aad3be096d9f40de9283f173d2b2ebb1/FLAG8ec49a7d7 [2024-10-11 13:51:43,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/32d8c0fa4/aad3be096d9f40de9283f173d2b2ebb1 [2024-10-11 13:51:43,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:51:43,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:51:43,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:51:43,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:51:43,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:51:43,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:51:43" (1/1) ... [2024-10-11 13:51:43,728 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd5c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:43, skipping insertion in model container [2024-10-11 13:51:43,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:51:43" (1/1) ... [2024-10-11 13:51:43,751 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:51:43,860 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-68.i[916,929] [2024-10-11 13:51:43,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:51:43,920 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:51:43,931 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-68.i[916,929] [2024-10-11 13:51:43,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:51:44,024 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:51:44,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:44 WrapperNode [2024-10-11 13:51:44,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:51:44,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:51:44,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:51:44,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:51:44,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:44" (1/1) ... [2024-10-11 13:51:44,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:44" (1/1) ... [2024-10-11 13:51:44,102 INFO L138 Inliner]: procedures = 39, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 504 [2024-10-11 13:51:44,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:51:44,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:51:44,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:51:44,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:51:44,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:44" (1/1) ... [2024-10-11 13:51:44,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:44" (1/1) ... [2024-10-11 13:51:44,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:44" (1/1) ... [2024-10-11 13:51:44,143 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 19 initializations are split as follows [2, 17]. The 20 writes are split as follows [0, 20]. [2024-10-11 13:51:44,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:44" (1/1) ... [2024-10-11 13:51:44,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:44" (1/1) ... [2024-10-11 13:51:44,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:44" (1/1) ... [2024-10-11 13:51:44,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:44" (1/1) ... [2024-10-11 13:51:44,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:44" (1/1) ... [2024-10-11 13:51:44,190 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:44" (1/1) ... [2024-10-11 13:51:44,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:51:44,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:51:44,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:51:44,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:51:44,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:44" (1/1) ... [2024-10-11 13:51:44,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:51:44,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:51:44,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:51:44,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:51:44,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:51:44,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 13:51:44,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 13:51:44,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 13:51:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 13:51:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:51:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:51:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 13:51:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 13:51:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:51:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:51:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:51:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:51:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:51:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:51:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 13:51:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 13:51:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:51:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:51:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 13:51:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 13:51:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:51:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:51:44,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:51:44,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:51:44,294 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:51:44,294 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:51:44,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:51:44,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:51:44,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:51:44,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:51:44,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 13:51:44,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 13:51:44,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:51:44,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:51:44,424 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:51:44,426 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:51:46,197 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-11 13:51:46,198 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:51:46,237 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:51:46,238 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:51:46,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:51:46 BoogieIcfgContainer [2024-10-11 13:51:46,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:51:46,240 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:51:46,240 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:51:46,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:51:46,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:51:43" (1/3) ... [2024-10-11 13:51:46,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91bbe77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:51:46, skipping insertion in model container [2024-10-11 13:51:46,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:44" (2/3) ... [2024-10-11 13:51:46,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@91bbe77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:51:46, skipping insertion in model container [2024-10-11 13:51:46,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:51:46" (3/3) ... [2024-10-11 13:51:46,244 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-68.i [2024-10-11 13:51:46,257 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:51:46,257 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:51:46,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:51:46,305 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;@245586e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:51:46,305 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:51:46,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:46,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 13:51:46,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:46,320 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:46,321 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:46,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:46,325 INFO L85 PathProgramCache]: Analyzing trace with hash 48315247, now seen corresponding path program 1 times [2024-10-11 13:51:46,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:51:46,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956786180] [2024-10-11 13:51:46,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:46,337 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-11 13:51:46,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:51:46,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 13:51:46,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:51:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:46,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:51:46,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:51:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-11 13:51:46,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:51:46,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:51:46,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956786180] [2024-10-11 13:51:46,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956786180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:46,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:46,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:51:46,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867505224] [2024-10-11 13:51:46,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:46,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:51:46,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:51:46,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:51:46,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:51:46,881 INFO L87 Difference]: Start difference. First operand has 107 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:51:46,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:46,932 INFO L93 Difference]: Finished difference Result 211 states and 335 transitions. [2024-10-11 13:51:46,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:51:46,934 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2024-10-11 13:51:46,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:46,942 INFO L225 Difference]: With dead ends: 211 [2024-10-11 13:51:46,943 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 13:51:46,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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-11 13:51:46,951 INFO L432 NwaCegarLoop]: 151 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, 151 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-11 13:51:46,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:51:46,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 13:51:46,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-11 13:51:46,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:46,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2024-10-11 13:51:46,993 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 141 [2024-10-11 13:51:46,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:46,994 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2024-10-11 13:51:46,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:51:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2024-10-11 13:51:46,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 13:51:47,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:47,000 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:47,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:51:47,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 13:51:47,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:47,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:47,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1693884809, now seen corresponding path program 1 times [2024-10-11 13:51:47,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:51:47,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56983207] [2024-10-11 13:51:47,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:47,203 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-11 13:51:47,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:51:47,204 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 13:51:47,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:51:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:47,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:51:47,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:51:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:51:47,674 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:51:47,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:51:47,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56983207] [2024-10-11 13:51:47,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56983207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:47,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:47,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:51:47,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564428664] [2024-10-11 13:51:47,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:47,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:51:47,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:51:47,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:51:47,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:51:47,679 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:47,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:47,770 INFO L93 Difference]: Finished difference Result 212 states and 313 transitions. [2024-10-11 13:51:47,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:51:47,771 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2024-10-11 13:51:47,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:47,773 INFO L225 Difference]: With dead ends: 212 [2024-10-11 13:51:47,775 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 13:51:47,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:51:47,778 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:47,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 583 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:51:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 13:51:47,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-11 13:51:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:47,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 158 transitions. [2024-10-11 13:51:47,798 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 158 transitions. Word has length 141 [2024-10-11 13:51:47,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:47,802 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 158 transitions. [2024-10-11 13:51:47,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 158 transitions. [2024-10-11 13:51:47,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 13:51:47,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:47,804 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:47,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 13:51:48,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 13:51:48,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:48,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:48,006 INFO L85 PathProgramCache]: Analyzing trace with hash -774864519, now seen corresponding path program 1 times [2024-10-11 13:51:48,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:51:48,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862247022] [2024-10-11 13:51:48,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:48,007 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-11 13:51:48,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:51:48,009 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 13:51:48,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:51:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:48,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:51:48,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:51:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:51:48,476 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:51:48,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:51:48,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862247022] [2024-10-11 13:51:48,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862247022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:48,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:48,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:51:48,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723410524] [2024-10-11 13:51:48,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:48,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:51:48,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:51:48,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:51:48,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:51:48,479 INFO L87 Difference]: Start difference. First operand 108 states and 158 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:48,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:48,544 INFO L93 Difference]: Finished difference Result 218 states and 319 transitions. [2024-10-11 13:51:48,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:51:48,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2024-10-11 13:51:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:48,549 INFO L225 Difference]: With dead ends: 218 [2024-10-11 13:51:48,549 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 13:51:48,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:51:48,550 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:48,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 588 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:51:48,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 13:51:48,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-10-11 13:51:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 159 transitions. [2024-10-11 13:51:48,561 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 159 transitions. Word has length 141 [2024-10-11 13:51:48,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:48,563 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 159 transitions. [2024-10-11 13:51:48,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:48,564 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 159 transitions. [2024-10-11 13:51:48,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 13:51:48,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:48,565 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:48,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 13:51:48,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 13:51:48,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:48,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:48,771 INFO L85 PathProgramCache]: Analyzing trace with hash -597135420, now seen corresponding path program 1 times [2024-10-11 13:51:48,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:51:48,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704009799] [2024-10-11 13:51:48,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:48,772 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-11 13:51:48,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:51:48,774 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 13:51:48,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:51:49,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:49,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:51:49,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:51:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:51:49,186 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:51:49,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:51:49,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704009799] [2024-10-11 13:51:49,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704009799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:49,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:49,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:51:49,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211257517] [2024-10-11 13:51:49,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:49,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:51:49,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:51:49,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:51:49,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:51:49,192 INFO L87 Difference]: Start difference. First operand 109 states and 159 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:49,245 INFO L93 Difference]: Finished difference Result 222 states and 324 transitions. [2024-10-11 13:51:49,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:51:49,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-10-11 13:51:49,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:49,247 INFO L225 Difference]: With dead ends: 222 [2024-10-11 13:51:49,250 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 13:51:49,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:51:49,251 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:49,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:51:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 13:51:49,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-11 13:51:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.372340425531915) internal successors, (129), 94 states have internal predecessors, (129), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2024-10-11 13:51:49,263 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 143 [2024-10-11 13:51:49,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:49,265 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2024-10-11 13:51:49,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:49,265 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2024-10-11 13:51:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 13:51:49,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:49,266 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:49,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:51:49,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 13:51:49,467 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:49,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:49,468 INFO L85 PathProgramCache]: Analyzing trace with hash -990162430, now seen corresponding path program 1 times [2024-10-11 13:51:49,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:51:49,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12556900] [2024-10-11 13:51:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:49,469 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-11 13:51:49,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:51:49,471 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 13:51:49,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:51:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:49,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 13:51:49,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:51:49,869 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:51:49,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:51:49,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:51:49,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12556900] [2024-10-11 13:51:49,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12556900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:49,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:49,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:51:49,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917918915] [2024-10-11 13:51:49,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:49,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:51:49,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:51:49,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:51:49,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:51:49,871 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:50,005 INFO L93 Difference]: Finished difference Result 230 states and 332 transitions. [2024-10-11 13:51:50,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:51:50,006 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-10-11 13:51:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:50,007 INFO L225 Difference]: With dead ends: 230 [2024-10-11 13:51:50,007 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 13:51:50,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 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-11 13:51:50,008 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:50,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 838 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:51:50,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 13:51:50,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2024-10-11 13:51:50,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2024-10-11 13:51:50,014 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 143 [2024-10-11 13:51:50,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:50,015 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2024-10-11 13:51:50,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:50,015 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2024-10-11 13:51:50,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 13:51:50,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:50,016 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:50,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:51:50,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-11 13:51:50,217 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:50,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash -932904128, now seen corresponding path program 1 times [2024-10-11 13:51:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:51:50,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469272462] [2024-10-11 13:51:50,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:50,218 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-11 13:51:50,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:51:50,221 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-11 13:51:50,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:51:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:50,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:51:50,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:51:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:51:50,666 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:51:50,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:51:50,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469272462] [2024-10-11 13:51:50,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [469272462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:50,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:50,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:51:50,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846686878] [2024-10-11 13:51:50,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:50,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:51:50,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:51:50,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:51:50,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:51:50,668 INFO L87 Difference]: Start difference. First operand 117 states and 167 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:50,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:50,878 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2024-10-11 13:51:50,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:51:50,878 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-10-11 13:51:50,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:50,880 INFO L225 Difference]: With dead ends: 236 [2024-10-11 13:51:50,880 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 13:51:50,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 136 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-11 13:51:50,881 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 971 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:50,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 971 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:51:50,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 13:51:50,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-10-11 13:51:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.35) internal successors, (135), 100 states have internal predecessors, (135), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:50,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2024-10-11 13:51:50,886 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 169 transitions. Word has length 143 [2024-10-11 13:51:50,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:50,887 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 169 transitions. [2024-10-11 13:51:50,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:50,887 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 169 transitions. [2024-10-11 13:51:50,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 13:51:50,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:50,888 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:50,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 13:51:51,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-11 13:51:51,090 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:51,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:51,090 INFO L85 PathProgramCache]: Analyzing trace with hash -932844546, now seen corresponding path program 1 times [2024-10-11 13:51:51,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:51:51,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847177601] [2024-10-11 13:51:51,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:51,091 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-11 13:51:51,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:51:51,093 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-11 13:51:51,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:51:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:51,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 13:51:51,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:51:51,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-10-11 13:51:51,531 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 13:51:51,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:51:51,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:51:51,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847177601] [2024-10-11 13:51:51,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847177601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:51,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:51,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:51:51,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582870263] [2024-10-11 13:51:51,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:51,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:51:51,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:51:51,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:51:51,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:51:51,533 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:53,106 INFO L93 Difference]: Finished difference Result 238 states and 338 transitions. [2024-10-11 13:51:53,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:51:53,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2024-10-11 13:51:53,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:53,107 INFO L225 Difference]: With dead ends: 238 [2024-10-11 13:51:53,108 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 13:51:53,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 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-11 13:51:53,109 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 152 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:53,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 425 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 13:51:53,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 13:51:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-10-11 13:51:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.34) internal successors, (134), 100 states have internal predecessors, (134), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2024-10-11 13:51:53,117 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 143 [2024-10-11 13:51:53,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:53,117 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2024-10-11 13:51:53,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-11 13:51:53,117 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2024-10-11 13:51:53,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 13:51:53,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:53,118 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:53,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 13:51:53,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-11 13:51:53,319 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:53,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:53,320 INFO L85 PathProgramCache]: Analyzing trace with hash 188888196, now seen corresponding path program 1 times [2024-10-11 13:51:53,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:51:53,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504875904] [2024-10-11 13:51:53,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:53,320 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-11 13:51:53,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:51:53,323 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-11 13:51:53,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:51:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:53,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:51:53,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:51:53,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-10-11 13:51:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 13:51:53,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:51:53,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:51:53,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504875904] [2024-10-11 13:51:53,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504875904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:53,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:53,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:51:53,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716729798] [2024-10-11 13:51:53,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:53,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:51:53,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:51:53,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:51:53,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:51:53,768 INFO L87 Difference]: Start difference. First operand 119 states and 168 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:51:55,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:55,203 INFO L93 Difference]: Finished difference Result 238 states and 336 transitions. [2024-10-11 13:51:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:51:55,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2024-10-11 13:51:55,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:55,205 INFO L225 Difference]: With dead ends: 238 [2024-10-11 13:51:55,205 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 13:51:55,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:51:55,206 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 141 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:55,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 420 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 13:51:55,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 13:51:55,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-10-11 13:51:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.33) internal successors, (133), 100 states have internal predecessors, (133), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2024-10-11 13:51:55,218 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 167 transitions. Word has length 145 [2024-10-11 13:51:55,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:55,219 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 167 transitions. [2024-10-11 13:51:55,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:51:55,219 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 167 transitions. [2024-10-11 13:51:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-11 13:51:55,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:55,224 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:55,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-11 13:51:55,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-11 13:51:55,426 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:55,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:55,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1708422978, now seen corresponding path program 1 times [2024-10-11 13:51:55,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:51:55,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485351951] [2024-10-11 13:51:55,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:55,427 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-11 13:51:55,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:51:55,429 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-11 13:51:55,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:51:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:55,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:51:55,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:51:55,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:51:55,984 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-11 13:51:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:51:56,020 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:51:56,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:51:56,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485351951] [2024-10-11 13:51:56,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485351951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:56,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:56,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:51:56,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351499320] [2024-10-11 13:51:56,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:56,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:51:56,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:51:56,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:51:56,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:51:56,029 INFO L87 Difference]: Start difference. First operand 119 states and 167 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:51:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:57,408 INFO L93 Difference]: Finished difference Result 238 states and 334 transitions. [2024-10-11 13:51:57,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:51:57,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 147 [2024-10-11 13:51:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:57,410 INFO L225 Difference]: With dead ends: 238 [2024-10-11 13:51:57,410 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 13:51:57,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 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-11 13:51:57,410 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 117 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:57,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 419 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 13:51:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 13:51:57,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-10-11 13:51:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.32) internal successors, (132), 100 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 166 transitions. [2024-10-11 13:51:57,415 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 166 transitions. Word has length 147 [2024-10-11 13:51:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:57,415 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 166 transitions. [2024-10-11 13:51:57,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:51:57,415 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 166 transitions. [2024-10-11 13:51:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-11 13:51:57,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:57,416 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:57,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:51:57,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-11 13:51:57,617 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:51:57,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:51:57,618 INFO L85 PathProgramCache]: Analyzing trace with hash 592450052, now seen corresponding path program 1 times [2024-10-11 13:51:57,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:51:57,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137755770] [2024-10-11 13:51:57,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:51:57,618 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-11 13:51:57,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:51:57,619 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-11 13:51:57,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:51:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:51:58,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 13:51:58,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:51:58,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:51:58,155 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-11 13:51:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-10-11 13:51:58,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:51:58,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:51:58,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137755770] [2024-10-11 13:51:58,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [137755770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:51:58,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:51:58,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:51:58,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517562866] [2024-10-11 13:51:58,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:51:58,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:51:58,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:51:58,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:51:58,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:51:58,186 INFO L87 Difference]: Start difference. First operand 119 states and 166 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:51:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:51:59,875 INFO L93 Difference]: Finished difference Result 238 states and 332 transitions. [2024-10-11 13:51:59,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:51:59,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 149 [2024-10-11 13:51:59,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:51:59,876 INFO L225 Difference]: With dead ends: 238 [2024-10-11 13:51:59,876 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 13:51:59,877 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-11 13:51:59,877 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 108 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:51:59,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 413 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 13:51:59,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 13:51:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2024-10-11 13:51:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 13:51:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 165 transitions. [2024-10-11 13:51:59,881 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 165 transitions. Word has length 149 [2024-10-11 13:51:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:51:59,881 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 165 transitions. [2024-10-11 13:51:59,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 13:51:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 165 transitions. [2024-10-11 13:51:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-11 13:51:59,882 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:51:59,882 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:51:59,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:52:00,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/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-11 13:52:00,087 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:52:00,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:52:00,087 INFO L85 PathProgramCache]: Analyzing trace with hash 833568894, now seen corresponding path program 1 times [2024-10-11 13:52:00,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:52:00,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908532816] [2024-10-11 13:52:00,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:52:00,088 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-11 13:52:00,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:52:00,090 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/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-11 13:52:00,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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