/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-47.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:30:31,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:30:31,578 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:30:31,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:30:31,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:30:31,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:30:31,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:30:31,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:30:31,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:30:31,618 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:30:31,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:30:31,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:30:31,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:30:31,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:30:31,621 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:30:31,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:30:31,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:30:31,622 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:30:31,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:30:31,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:30:31,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:30:31,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:30:31,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:30:31,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:30:31,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:30:31,624 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:30:31,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:30:31,624 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:30:31,625 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:30:31,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:30:31,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:30:31,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:30:31,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:30:31,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:30:31,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:30:31,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:30:31,627 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:30:31,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:30:31,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:30:31,627 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:30:31,627 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:30:31,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:30:31,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:30:31,628 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:30:31,870 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:30:31,885 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:30:31,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:30:31,887 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:30:31,889 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:30:31,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-47.i [2023-12-15 21:30:33,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:30:33,242 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:30:33,247 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-47.i [2023-12-15 21:30:33,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1d1a5e6c/70bef763c148427c8119b5f3f136d337/FLAGac3a40e1b [2023-12-15 21:30:33,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1d1a5e6c/70bef763c148427c8119b5f3f136d337 [2023-12-15 21:30:33,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:30:33,270 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:30:33,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:30:33,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:30:33,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:30:33,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:30:33" (1/1) ... [2023-12-15 21:30:33,281 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b5033e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:33, skipping insertion in model container [2023-12-15 21:30:33,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:30:33" (1/1) ... [2023-12-15 21:30:33,311 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:30:33,442 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-47.i[916,929] [2023-12-15 21:30:33,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:30:33,496 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:30:33,512 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-47.i[916,929] [2023-12-15 21:30:33,543 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:30:33,558 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:30:33,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:33 WrapperNode [2023-12-15 21:30:33,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:30:33,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:30:33,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:30:33,559 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:30:33,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:33" (1/1) ... [2023-12-15 21:30:33,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:33" (1/1) ... [2023-12-15 21:30:33,620 INFO L138 Inliner]: procedures = 29, calls = 139, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 457 [2023-12-15 21:30:33,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:30:33,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:30:33,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:30:33,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:30:33,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:33" (1/1) ... [2023-12-15 21:30:33,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:33" (1/1) ... [2023-12-15 21:30:33,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:33" (1/1) ... [2023-12-15 21:30:33,652 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 14, 28, 57, 14]. 50 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 3, 3, 1]. The 12 writes are split as follows [0, 2, 4, 4, 2]. [2023-12-15 21:30:33,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:33" (1/1) ... [2023-12-15 21:30:33,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:33" (1/1) ... [2023-12-15 21:30:33,668 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:33" (1/1) ... [2023-12-15 21:30:33,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:33" (1/1) ... [2023-12-15 21:30:33,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:33" (1/1) ... [2023-12-15 21:30:33,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:33" (1/1) ... [2023-12-15 21:30:33,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:30:33,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:30:33,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:30:33,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:30:33,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:33" (1/1) ... [2023-12-15 21:30:33,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:30:33,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:30:33,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:30:33,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:30:33,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:30:33,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:30:33,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:30:33,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-15 21:30:33,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-15 21:30:33,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-15 21:30:33,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:30:33,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:30:33,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:30:33,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 21:30:33,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-15 21:30:33,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:30:33,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:30:33,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-15 21:30:33,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-15 21:30:33,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-15 21:30:33,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:30:33,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:30:33,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:30:33,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 21:30:33,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-15 21:30:33,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:30:33,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:30:33,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-15 21:30:33,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-15 21:30:33,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-15 21:30:33,744 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:30:33,744 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:30:33,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:30:33,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:30:33,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:30:33,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 21:30:33,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 21:30:33,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:30:33,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:30:33,849 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:30:33,850 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:30:34,221 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:30:34,255 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:30:34,255 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:30:34,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:30:34 BoogieIcfgContainer [2023-12-15 21:30:34,256 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:30:34,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:30:34,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:30:34,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:30:34,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:30:33" (1/3) ... [2023-12-15 21:30:34,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66318fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:30:34, skipping insertion in model container [2023-12-15 21:30:34,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:30:33" (2/3) ... [2023-12-15 21:30:34,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66318fd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:30:34, skipping insertion in model container [2023-12-15 21:30:34,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:30:34" (3/3) ... [2023-12-15 21:30:34,263 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-47.i [2023-12-15 21:30:34,276 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:30:34,277 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:30:34,310 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:30:34,316 INFO L357 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, mHoare=true, 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;@46624784, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:30:34,316 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:30:34,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 78 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 21:30:34,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-15 21:30:34,328 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:34,329 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:34,329 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:34,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:34,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1024927701, now seen corresponding path program 1 times [2023-12-15 21:30:34,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:34,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425651355] [2023-12-15 21:30:34,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:34,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:30:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:30:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:30:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:34,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:34,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425651355] [2023-12-15 21:30:34,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425651355] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:34,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:34,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:30:34,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733715761] [2023-12-15 21:30:34,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:34,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:30:34,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:34,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:30:34,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:30:34,646 INFO L87 Difference]: Start difference. First operand has 89 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 78 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-15 21:30:34,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:34,700 INFO L93 Difference]: Finished difference Result 175 states and 275 transitions. [2023-12-15 21:30:34,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:30:34,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2023-12-15 21:30:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:34,710 INFO L225 Difference]: With dead ends: 175 [2023-12-15 21:30:34,710 INFO L226 Difference]: Without dead ends: 87 [2023-12-15 21:30:34,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:30:34,719 INFO L413 NwaCegarLoop]: 125 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, 125 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 [2023-12-15 21:30:34,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:30:34,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-15 21:30:34,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-12-15 21:30:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 76 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 21:30:34,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2023-12-15 21:30:34,760 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 79 [2023-12-15 21:30:34,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:34,761 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2023-12-15 21:30:34,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-15 21:30:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2023-12-15 21:30:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-15 21:30:34,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:34,764 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:34,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:30:34,765 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:34,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:34,765 INFO L85 PathProgramCache]: Analyzing trace with hash 496519827, now seen corresponding path program 1 times [2023-12-15 21:30:34,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:34,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564809031] [2023-12-15 21:30:34,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:34,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:30:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:30:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:30:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:34,963 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:34,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:34,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564809031] [2023-12-15 21:30:34,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564809031] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:34,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:34,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:30:34,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077414378] [2023-12-15 21:30:34,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:34,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:30:34,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:34,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:30:34,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:30:34,967 INFO L87 Difference]: Start difference. First operand 87 states and 129 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:35,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:35,011 INFO L93 Difference]: Finished difference Result 174 states and 259 transitions. [2023-12-15 21:30:35,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:30:35,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 79 [2023-12-15 21:30:35,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:35,016 INFO L225 Difference]: With dead ends: 174 [2023-12-15 21:30:35,016 INFO L226 Difference]: Without dead ends: 88 [2023-12-15 21:30:35,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:30:35,020 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:35,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:30:35,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-15 21:30:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-15 21:30:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 21:30:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2023-12-15 21:30:35,032 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 79 [2023-12-15 21:30:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:35,033 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2023-12-15 21:30:35,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2023-12-15 21:30:35,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-15 21:30:35,035 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:35,036 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:35,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:30:35,038 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:35,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:35,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1497624879, now seen corresponding path program 1 times [2023-12-15 21:30:35,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:35,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303984149] [2023-12-15 21:30:35,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:35,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:30:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:30:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:30:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:35,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:35,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303984149] [2023-12-15 21:30:35,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303984149] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:35,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:35,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:30:35,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379720843] [2023-12-15 21:30:35,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:35,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:30:35,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:35,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:30:35,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:30:35,367 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:35,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:35,464 INFO L93 Difference]: Finished difference Result 201 states and 298 transitions. [2023-12-15 21:30:35,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:30:35,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 79 [2023-12-15 21:30:35,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:35,472 INFO L225 Difference]: With dead ends: 201 [2023-12-15 21:30:35,472 INFO L226 Difference]: Without dead ends: 114 [2023-12-15 21:30:35,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:30:35,474 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 90 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:30:35,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 523 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:30:35,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-15 21:30:35,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 91. [2023-12-15 21:30:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.4375) internal successors, (115), 80 states have internal predecessors, (115), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 21:30:35,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2023-12-15 21:30:35,485 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 79 [2023-12-15 21:30:35,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:35,486 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2023-12-15 21:30:35,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2023-12-15 21:30:35,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-15 21:30:35,488 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:35,488 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:35,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:30:35,489 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:35,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:35,489 INFO L85 PathProgramCache]: Analyzing trace with hash -894680545, now seen corresponding path program 1 times [2023-12-15 21:30:35,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:35,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99264630] [2023-12-15 21:30:35,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:35,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:30:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:30:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:30:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:30:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:30:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:30:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:30:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:30:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:30:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:30:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-15 21:30:35,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:30:35,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99264630] [2023-12-15 21:30:35,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99264630] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:30:35,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:30:35,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:30:35,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166378508] [2023-12-15 21:30:35,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:30:35,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:30:35,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:30:35,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:30:35,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:30:35,662 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:35,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:30:35,699 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2023-12-15 21:30:35,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:30:35,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 79 [2023-12-15 21:30:35,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:30:35,702 INFO L225 Difference]: With dead ends: 185 [2023-12-15 21:30:35,702 INFO L226 Difference]: Without dead ends: 95 [2023-12-15 21:30:35,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:30:35,712 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 3 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 363 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 [2023-12-15 21:30:35,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 363 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:30:35,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-15 21:30:35,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2023-12-15 21:30:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 21:30:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2023-12-15 21:30:35,723 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 79 [2023-12-15 21:30:35,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:30:35,723 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2023-12-15 21:30:35,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-15 21:30:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2023-12-15 21:30:35,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-15 21:30:35,725 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:30:35,725 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:30:35,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:30:35,725 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:30:35,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:30:35,726 INFO L85 PathProgramCache]: Analyzing trace with hash -894620963, now seen corresponding path program 1 times [2023-12-15 21:30:35,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:30:35,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701913527] [2023-12-15 21:30:35,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:30:35,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:30:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:30:35,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:30:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:30:35,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:30:35,896 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:30:35,897 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:30:35,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:30:35,901 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-15 21:30:35,904 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:30:35,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:30:35 BoogieIcfgContainer [2023-12-15 21:30:35,970 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:30:35,971 INFO L158 Benchmark]: Toolchain (without parser) took 2701.06ms. Allocated memory is still 296.7MB. Free memory was 241.4MB in the beginning and 174.7MB in the end (delta: 66.8MB). Peak memory consumption was 67.1MB. Max. memory is 8.0GB. [2023-12-15 21:30:35,971 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 145.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:30:35,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 287.12ms. Allocated memory is still 296.7MB. Free memory was 241.0MB in the beginning and 227.2MB in the end (delta: 13.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-15 21:30:35,971 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.18ms. Allocated memory is still 296.7MB. Free memory was 227.2MB in the beginning and 223.9MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:30:35,972 INFO L158 Benchmark]: Boogie Preprocessor took 58.02ms. Allocated memory is still 296.7MB. Free memory was 223.6MB in the beginning and 219.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:30:35,972 INFO L158 Benchmark]: RCFGBuilder took 575.21ms. Allocated memory is still 296.7MB. Free memory was 219.4MB in the beginning and 246.4MB in the end (delta: -27.0MB). Peak memory consumption was 18.4MB. Max. memory is 8.0GB. [2023-12-15 21:30:35,972 INFO L158 Benchmark]: TraceAbstraction took 1712.47ms. Allocated memory is still 296.7MB. Free memory was 245.9MB in the beginning and 174.7MB in the end (delta: 71.2MB). Peak memory consumption was 70.7MB. Max. memory is 8.0GB. [2023-12-15 21:30:35,973 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.12ms. Allocated memory is still 192.9MB. Free memory is still 145.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 287.12ms. Allocated memory is still 296.7MB. Free memory was 241.0MB in the beginning and 227.2MB in the end (delta: 13.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.18ms. Allocated memory is still 296.7MB. Free memory was 227.2MB in the beginning and 223.9MB in the end (delta: 3.3MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.02ms. Allocated memory is still 296.7MB. Free memory was 223.6MB in the beginning and 219.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 575.21ms. Allocated memory is still 296.7MB. Free memory was 219.4MB in the beginning and 246.4MB in the end (delta: -27.0MB). Peak memory consumption was 18.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1712.47ms. Allocated memory is still 296.7MB. Free memory was 245.9MB in the beginning and 174.7MB in the end (delta: 71.2MB). Peak memory consumption was 70.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 1, 1 }; [L25-L27] double double_Array_0[3] = { 3.5, 3.8, 24.575 }; [L25-L27] double double_Array_0[3] = { 3.5, 3.8, 24.575 }; [L25-L27] double double_Array_0[3] = { 3.5, 3.8, 24.575 }; [L25-L27] double double_Array_0[3] = { 3.5, 3.8, 24.575 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, 16, 4 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, 16, 4 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, 16, 4 }; [L28-L30] signed char signed_char_Array_0[3] = { 16, 16, 4 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 8 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 8 }; [L34] signed long int last_1_signed_long_int_Array_0_0_ = 8; [L88] isInitial = 1 [L89] FCALL initially() [L90] COND TRUE 1 [L91] CALL updateLastVariables() [L81] EXPR signed_long_int_Array_0[0] [L81] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L91] RET updateLastVariables() [L92] CALL updateVariables() [L65] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L68] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L71] double_Array_0[0] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[0] [L72] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L72] EXPR double_Array_0[0] [L72] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L72] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L73] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L74] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L75] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L76] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[2] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L78] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L92] RET updateVariables() [L93] CALL step() [L38] COND FALSE !(-4 > last_1_signed_long_int_Array_0_0_) [L43] EXPR signed_char_Array_0[1] [L43] signed_char_Array_0[0] = signed_char_Array_0[1] [L45] EXPR BOOL_unsigned_char_Array_0[0] [L45] unsigned char stepLocal_0 = ! BOOL_unsigned_char_Array_0[0]; [L46] stepLocal_0 || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=0] [L46] stepLocal_0 || BOOL_unsigned_char_Array_0[1] [L46] EXPR BOOL_unsigned_char_Array_0[1] [L46] stepLocal_0 || BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=0] [L46] COND FALSE !(stepLocal_0 || BOOL_unsigned_char_Array_0[1]) [L53] EXPR double_Array_0[0] [L53] double_Array_0[1] = double_Array_0[0] [L54] EXPR double_Array_0[1] [L54] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L54] COND FALSE !(double_Array_0[1] <= double_Array_0[1]) [L59] EXPR signed_long_int_Array_0[0] [L59] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L59] COND TRUE signed_long_int_Array_0[0] > signed_char_Array_0[0] [L60] EXPR double_Array_0[0] [L60] double_Array_0[2] = double_Array_0[0] [L93] RET step() [L94] CALL, EXPR property() [L84] EXPR double_Array_0[1] [L84] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR (double_Array_0[1] <= double_Array_0[1]) ? (((signed_long_int_Array_0[0] + signed_long_int_Array_0[0]) >= (signed_long_int_Array_0[0] + signed_char_Array_0[0])) ? (double_Array_0[2] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : ((signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1) [L84] EXPR signed_long_int_Array_0[0] [L84] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR (signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1 [L84] EXPR double_Array_0[2] [L84] EXPR double_Array_0[0] [L84] EXPR (signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR (double_Array_0[1] <= double_Array_0[1]) ? (((signed_long_int_Array_0[0] + signed_long_int_Array_0[0]) >= (signed_long_int_Array_0[0] + signed_char_Array_0[0])) ? (double_Array_0[2] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : ((signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR ((double_Array_0[1] <= double_Array_0[1]) ? (((signed_long_int_Array_0[0] + signed_long_int_Array_0[0]) >= (signed_long_int_Array_0[0] + signed_char_Array_0[0])) ? (double_Array_0[2] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : ((signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1] + signed_char_Array_0[2]) < 0 ) ? -(signed_char_Array_0[1] + signed_char_Array_0[2]) : (signed_char_Array_0[1] + signed_char_Array_0[2]))))) : 1) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR ((double_Array_0[1] <= double_Array_0[1]) ? (((signed_long_int_Array_0[0] + signed_long_int_Array_0[0]) >= (signed_long_int_Array_0[0] + signed_char_Array_0[0])) ? (double_Array_0[2] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : ((signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1] + signed_char_Array_0[2]) < 0 ) ? -(signed_char_Array_0[1] + signed_char_Array_0[2]) : (signed_char_Array_0[1] + signed_char_Array_0[2]))))) : 1) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR (((double_Array_0[1] <= double_Array_0[1]) ? (((signed_long_int_Array_0[0] + signed_long_int_Array_0[0]) >= (signed_long_int_Array_0[0] + signed_char_Array_0[0])) ? (double_Array_0[2] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : ((signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1] + signed_char_Array_0[2]) < 0 ) ? -(signed_char_Array_0[1] + signed_char_Array_0[2]) : (signed_char_Array_0[1] + signed_char_Array_0[2]))))) : 1) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])))) && (((! BOOL_unsigned_char_Array_0[0]) || BOOL_unsigned_char_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) < 0 ) ? -((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) : ((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR (((double_Array_0[1] <= double_Array_0[1]) ? (((signed_long_int_Array_0[0] + signed_long_int_Array_0[0]) >= (signed_long_int_Array_0[0] + signed_char_Array_0[0])) ? (double_Array_0[2] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : ((signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1] + signed_char_Array_0[2]) < 0 ) ? -(signed_char_Array_0[1] + signed_char_Array_0[2]) : (signed_char_Array_0[1] + signed_char_Array_0[2]))))) : 1) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])))) && (((! BOOL_unsigned_char_Array_0[0]) || BOOL_unsigned_char_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) < 0 ) ? -((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) : ((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR ((((double_Array_0[1] <= double_Array_0[1]) ? (((signed_long_int_Array_0[0] + signed_long_int_Array_0[0]) >= (signed_long_int_Array_0[0] + signed_char_Array_0[0])) ? (double_Array_0[2] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : ((signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1] + signed_char_Array_0[2]) < 0 ) ? -(signed_char_Array_0[1] + signed_char_Array_0[2]) : (signed_char_Array_0[1] + signed_char_Array_0[2]))))) : 1) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])))) && (((! BOOL_unsigned_char_Array_0[0]) || BOOL_unsigned_char_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) < 0 ) ? -((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) : ((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))) : 1)) && (double_Array_0[1] == ((double) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84] EXPR ((((double_Array_0[1] <= double_Array_0[1]) ? (((signed_long_int_Array_0[0] + signed_long_int_Array_0[0]) >= (signed_long_int_Array_0[0] + signed_char_Array_0[0])) ? (double_Array_0[2] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : ((signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1] + signed_char_Array_0[2]) < 0 ) ? -(signed_char_Array_0[1] + signed_char_Array_0[2]) : (signed_char_Array_0[1] + signed_char_Array_0[2]))))) : 1) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])))) && (((! BOOL_unsigned_char_Array_0[0]) || BOOL_unsigned_char_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) < 0 ) ? -((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) : ((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))) : 1)) && (double_Array_0[1] == ((double) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L84-L85] return ((((double_Array_0[1] <= double_Array_0[1]) ? (((signed_long_int_Array_0[0] + signed_long_int_Array_0[0]) >= (signed_long_int_Array_0[0] + signed_char_Array_0[0])) ? (double_Array_0[2] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : ((signed_long_int_Array_0[0] > signed_char_Array_0[0]) ? (double_Array_0[2] == ((double) double_Array_0[0])) : 1)) && ((-4 > last_1_signed_long_int_Array_0_0_) ? (((~ last_1_signed_long_int_Array_0_0_) <= last_1_signed_long_int_Array_0_0_) ? (signed_char_Array_0[0] == ((signed char) ((((signed_char_Array_0[1] + signed_char_Array_0[2]) < 0 ) ? -(signed_char_Array_0[1] + signed_char_Array_0[2]) : (signed_char_Array_0[1] + signed_char_Array_0[2]))))) : 1) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])))) && (((! BOOL_unsigned_char_Array_0[0]) || BOOL_unsigned_char_Array_0[1]) ? ((! BOOL_unsigned_char_Array_0[1]) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) < 0 ) ? -((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))) : ((((signed_char_Array_0[0]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[0]) : (signed_char_Array_0[0]))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0]))) : 1)) && (double_Array_0[1] == ((double) double_Array_0[0])) ; [L94] RET, EXPR property() [L94] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_signed_long_int_Array_0_0_=8, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 5, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 93 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 93 mSDsluCounter, 1254 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 735 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 77 IncrementalHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 519 mSDtfsCounter, 77 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 25 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 395 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 576/576 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-15 21:30:35,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...