/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-s_file-51.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:40:44,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:40:44,558 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:40:44,562 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:40:44,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:40:44,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:40:44,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:40:44,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:40:44,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:40:44,579 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:40:44,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:40:44,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:40:44,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:40:44,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:40:44,580 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:40:44,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:40:44,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:40:44,581 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:40:44,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:40:44,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:40:44,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:40:44,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:40:44,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:40:44,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:40:44,587 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:40:44,588 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:40:44,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:40:44,588 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:40:44,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:40:44,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:40:44,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:40:44,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:40:44,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:40:44,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:40:44,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:40:44,590 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:40:44,590 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:40:44,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:40:44,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:40:44,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:40:44,590 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:40:44,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:40:44,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:40:44,591 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:40:44,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:40:44,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:40:44,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:40:44,819 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:40:44,819 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:40:44,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-51.i [2023-12-15 21:40:45,909 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:40:46,070 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:40:46,070 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-51.i [2023-12-15 21:40:46,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfdf57e92/7700e42b08b1430491653fc7e0dc87ab/FLAG7821d584a [2023-12-15 21:40:46,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfdf57e92/7700e42b08b1430491653fc7e0dc87ab [2023-12-15 21:40:46,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:40:46,093 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:40:46,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:40:46,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:40:46,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:40:46,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:40:46" (1/1) ... [2023-12-15 21:40:46,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c263e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:46, skipping insertion in model container [2023-12-15 21:40:46,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:40:46" (1/1) ... [2023-12-15 21:40:46,127 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:40:46,217 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-s_file-51.i[916,929] [2023-12-15 21:40:46,259 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:40:46,266 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:40:46,275 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-s_file-51.i[916,929] [2023-12-15 21:40:46,299 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:40:46,313 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:40:46,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:46 WrapperNode [2023-12-15 21:40:46,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:40:46,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:40:46,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:40:46,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:40:46,319 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:40:46" (1/1) ... [2023-12-15 21:40:46,328 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:40:46" (1/1) ... [2023-12-15 21:40:46,358 INFO L138 Inliner]: procedures = 29, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 548 [2023-12-15 21:40:46,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:40:46,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:40:46,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:40:46,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:40:46,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:46" (1/1) ... [2023-12-15 21:40:46,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:46" (1/1) ... [2023-12-15 21:40:46,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:46" (1/1) ... [2023-12-15 21:40:46,384 INFO L175 MemorySlicer]: Split 145 memory accesses to 2 slices as follows [2, 143]. 99 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 18 writes are split as follows [0, 18]. [2023-12-15 21:40:46,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:46" (1/1) ... [2023-12-15 21:40:46,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:46" (1/1) ... [2023-12-15 21:40:46,398 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:46" (1/1) ... [2023-12-15 21:40:46,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:46" (1/1) ... [2023-12-15 21:40:46,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:46" (1/1) ... [2023-12-15 21:40:46,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:46" (1/1) ... [2023-12-15 21:40:46,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:40:46,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:40:46,409 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:40:46,409 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:40:46,409 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:46" (1/1) ... [2023-12-15 21:40:46,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:40:46,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:40:46,431 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:40:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:40:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:40:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:40:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:40:46,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:40:46,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:40:46,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:40:46,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:40:46,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:40:46,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:40:46,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:40:46,464 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:40:46,464 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:40:46,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:40:46,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:40:46,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:40:46,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:40:46,445 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:40:46,574 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:40:46,576 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:40:46,986 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:40:47,009 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:40:47,009 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:40:47,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:40:47 BoogieIcfgContainer [2023-12-15 21:40:47,009 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:40:47,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:40:47,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:40:47,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:40:47,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:40:46" (1/3) ... [2023-12-15 21:40:47,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188410f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:40:47, skipping insertion in model container [2023-12-15 21:40:47,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:46" (2/3) ... [2023-12-15 21:40:47,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188410f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:40:47, skipping insertion in model container [2023-12-15 21:40:47,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:40:47" (3/3) ... [2023-12-15 21:40:47,015 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-51.i [2023-12-15 21:40:47,028 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:40:47,028 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:40:47,070 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:40:47,074 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;@7bd42246, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:40:47,075 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:40:47,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-15 21:40:47,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-15 21:40:47,094 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:40:47,095 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:40:47,096 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:40:47,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:40:47,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1938721467, now seen corresponding path program 1 times [2023-12-15 21:40:47,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:40:47,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615476151] [2023-12-15 21:40:47,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:47,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:40:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:40:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:40:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:40:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:40:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:40:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:40:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:40:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:40:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:40:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:40:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:40:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:40:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:40:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:40:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:40:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:40:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:40:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:40:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-15 21:40:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:47,463 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-15 21:40:47,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:40:47,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615476151] [2023-12-15 21:40:47,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615476151] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:40:47,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:40:47,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:40:47,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897210464] [2023-12-15 21:40:47,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:40:47,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:40:47,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:40:47,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:40:47,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:40:47,506 INFO L87 Difference]: Start difference. First operand has 117 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 96 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-15 21:40:47,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:40:47,554 INFO L93 Difference]: Finished difference Result 231 states and 369 transitions. [2023-12-15 21:40:47,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:40:47,557 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 144 [2023-12-15 21:40:47,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:40:47,562 INFO L225 Difference]: With dead ends: 231 [2023-12-15 21:40:47,562 INFO L226 Difference]: Without dead ends: 115 [2023-12-15 21:40:47,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:40:47,567 INFO L413 NwaCegarLoop]: 167 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, 167 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:40:47,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:40:47,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-15 21:40:47,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-12-15 21:40:47,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 94 states have internal predecessors, (133), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-15 21:40:47,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2023-12-15 21:40:47,598 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 144 [2023-12-15 21:40:47,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:40:47,598 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2023-12-15 21:40:47,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-15 21:40:47,598 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2023-12-15 21:40:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-15 21:40:47,601 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:40:47,601 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:40:47,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:40:47,601 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:40:47,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:40:47,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1087064099, now seen corresponding path program 1 times [2023-12-15 21:40:47,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:40:47,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885883373] [2023-12-15 21:40:47,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:47,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:40:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:40:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:40:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:40:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:40:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:40:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:40:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:40:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:40:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:40:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 21:40:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 21:40:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 21:40:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 21:40:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 21:40:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 21:40:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 21:40:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 21:40:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 21:40:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-15 21:40:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-15 21:40:48,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:40:48,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885883373] [2023-12-15 21:40:48,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885883373] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:40:48,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:40:48,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:40:48,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700645401] [2023-12-15 21:40:48,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:40:48,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:40:48,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:40:48,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:40:48,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:40:48,430 INFO L87 Difference]: Start difference. First operand 115 states and 171 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-15 21:40:48,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:40:48,577 INFO L93 Difference]: Finished difference Result 229 states and 341 transitions. [2023-12-15 21:40:48,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:40:48,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 144 [2023-12-15 21:40:48,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:40:48,583 INFO L225 Difference]: With dead ends: 229 [2023-12-15 21:40:48,583 INFO L226 Difference]: Without dead ends: 115 [2023-12-15 21:40:48,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:40:48,585 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:40:48,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 408 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:40:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-15 21:40:48,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-12-15 21:40:48,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-15 21:40:48,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 170 transitions. [2023-12-15 21:40:48,594 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 170 transitions. Word has length 144 [2023-12-15 21:40:48,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:40:48,595 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 170 transitions. [2023-12-15 21:40:48,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-15 21:40:48,595 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 170 transitions. [2023-12-15 21:40:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-15 21:40:48,604 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:40:48,604 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:40:48,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:40:48,604 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:40:48,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:40:48,605 INFO L85 PathProgramCache]: Analyzing trace with hash 536090028, now seen corresponding path program 1 times [2023-12-15 21:40:48,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:40:48,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82841474] [2023-12-15 21:40:48,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:48,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:40:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:40:48,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:40:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:40:48,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:40:48,855 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:40:48,856 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:40:48,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:40:48,860 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-15 21:40:48,862 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:40:48,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:40:48 BoogieIcfgContainer [2023-12-15 21:40:48,929 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:40:48,930 INFO L158 Benchmark]: Toolchain (without parser) took 2836.16ms. Allocated memory is still 291.5MB. Free memory was 247.6MB in the beginning and 231.9MB in the end (delta: 15.7MB). Peak memory consumption was 140.9MB. Max. memory is 8.0GB. [2023-12-15 21:40:48,930 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 228.6MB. Free memory is still 178.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:40:48,930 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.28ms. Allocated memory is still 291.5MB. Free memory was 247.6MB in the beginning and 230.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-15 21:40:48,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.32ms. Allocated memory is still 291.5MB. Free memory was 230.8MB in the beginning and 226.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:40:48,936 INFO L158 Benchmark]: Boogie Preprocessor took 49.08ms. Allocated memory is still 291.5MB. Free memory was 226.6MB in the beginning and 222.0MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 21:40:48,936 INFO L158 Benchmark]: RCFGBuilder took 600.88ms. Allocated memory is still 291.5MB. Free memory was 222.0MB in the beginning and 251.7MB in the end (delta: -29.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-15 21:40:48,937 INFO L158 Benchmark]: TraceAbstraction took 1918.35ms. Allocated memory is still 291.5MB. Free memory was 250.6MB in the beginning and 231.9MB in the end (delta: 18.7MB). Peak memory consumption was 143.0MB. Max. memory is 8.0GB. [2023-12-15 21:40:48,941 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.11ms. Allocated memory is still 228.6MB. Free memory is still 178.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 217.28ms. Allocated memory is still 291.5MB. Free memory was 247.6MB in the beginning and 230.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.32ms. Allocated memory is still 291.5MB. Free memory was 230.8MB in the beginning and 226.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.08ms. Allocated memory is still 291.5MB. Free memory was 226.6MB in the beginning and 222.0MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 600.88ms. Allocated memory is still 291.5MB. Free memory was 222.0MB in the beginning and 251.7MB in the end (delta: -29.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 1918.35ms. Allocated memory is still 291.5MB. Free memory was 250.6MB in the beginning and 231.9MB in the end (delta: 18.7MB). Peak memory consumption was 143.0MB. 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 121. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10.8, 0, -16, 100.01, 999999999.4, 10.6, 127.5, 1, 2467894503, 2565572511, 500, 2277019112, 2745650083, 8 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10.8, 0, -16, 100.01, 999999999.4, 10.6, 127.5, 1, 2467894503, 2565572511, 500, 2277019112, 2745650083, 8 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10.8, 0, -16, 100.01, 999999999.4, 10.6, 127.5, 1, 2467894503, 2565572511, 500, 2277019112, 2745650083, 8 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10.8, 0, -16, 100.01, 999999999.4, 10.6, 127.5, 1, 2467894503, 2565572511, 500, 2277019112, 2745650083, 8 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10.8, 0, -16, 100.01, 999999999.4, 10.6, 127.5, 1, 2467894503, 2565572511, 500, 2277019112, 2745650083, 8 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10.8, 0, -16, 100.01, 999999999.4, 10.6, 127.5, 1, 2467894503, 2565572511, 500, 2277019112, 2745650083, 8 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10.8, 0, -16, 100.01, 999999999.4, 10.6, 127.5, 1, 2467894503, 2565572511, 500, 2277019112, 2745650083, 8 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10.8, 0, -16, 100.01, 999999999.4, 10.6, 127.5, 1, 2467894503, 2565572511, 500, 2277019112, 2745650083, 8 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10.8, 0, -16, 100.01, 999999999.4, 10.6, 127.5, 1, 2467894503, 2565572511, 500, 2277019112, 2745650083, 8 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10.8, 0, -16, 100.01, 999999999.4, 10.6, 127.5, 1, 2467894503, 2565572511, 500, 2277019112, 2745650083, 8 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10.8, 0, -16, 100.01, 999999999.4, 10.6, 127.5, 1, 2467894503, 2565572511, 500, 2277019112, 2745650083, 8 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10.8, 0, -16, 100.01, 999999999.4, 10.6, 127.5, 1, 2467894503, 2565572511, 500, 2277019112, 2745650083, 8 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10.8, 0, -16, 100.01, 999999999.4, 10.6, 127.5, 1, 2467894503, 2565572511, 500, 2277019112, 2745650083, 8 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10.8, 0, -16, 100.01, 999999999.4, 10.6, 127.5, 1, 2467894503, 2565572511, 500, 2277019112, 2745650083, 8 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10.8, 0, -16, 100.01, 999999999.4, 10.6, 127.5, 1, 2467894503, 2565572511, 500, 2277019112, 2745650083, 8 }; [L55] unsigned long int last_1_WrapperStruct00_var_1_17 = 8; [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L118] EXPR WrapperStruct00.var_1_17 [L118] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L86] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L87] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L88] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L89] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L90] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -32768) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -32768) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L92] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_5 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_5 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L93] WrapperStruct00.var_1_6 = __VERIFIER_nondet_double() [L94] EXPR WrapperStruct00.var_1_6 [L94] EXPR WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L94] EXPR WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_6 [L94] EXPR WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L94] EXPR (WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L94] EXPR (WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L95] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L96] EXPR WrapperStruct00.var_1_7 [L96] EXPR WrapperStruct00.var_1_7 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L96] EXPR WrapperStruct00.var_1_7 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_7 [L96] EXPR WrapperStruct00.var_1_7 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L96] EXPR (WrapperStruct00.var_1_7 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L96] EXPR (WrapperStruct00.var_1_7 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L97] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L98] EXPR WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L98] EXPR (WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L98] EXPR (WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L99] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L100] EXPR WrapperStruct00.var_1_9 [L100] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L100] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_9 [L100] EXPR WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L100] EXPR (WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L100] EXPR (WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L101] WrapperStruct00.var_1_11 = __VERIFIER_nondet_ulong() [L102] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L103] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L104] WrapperStruct00.var_1_12 = __VERIFIER_nondet_ulong() [L105] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L106] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L107] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ulong() [L108] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L109] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L110] WrapperStruct00.var_1_15 = __VERIFIER_nondet_ulong() [L111] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L112] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L113] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ulong() [L114] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L115] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L129] RET updateVariables() [L130] CALL step() [L59] unsigned long int stepLocal_1 = - last_1_WrapperStruct00_var_1_17; [L60] EXPR WrapperStruct00.var_1_11 [L60] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L60] EXPR ((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_12) [L60] EXPR WrapperStruct00.var_1_11 [L60] EXPR ((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_12) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8, stepLocal_1=4294967288] [L60] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L60] COND FALSE !((((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_12))) - WrapperStruct00.var_1_13) != stepLocal_1) [L63] EXPR WrapperStruct00.var_1_15 [L63] WrapperStruct00.var_1_10 = WrapperStruct00.var_1_15 [L65] EXPR WrapperStruct00.var_1_10 [L65] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L65] COND TRUE WrapperStruct00.var_1_10 <= WrapperStruct00.var_1_10 [L66] EXPR WrapperStruct00.var_1_2 [L66] WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_10 == ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_12)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8, stepLocal_1=4294967288] [L66] WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_10 == ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_12)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L66] COND FALSE !(WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_10 == ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_12))))) [L74] EXPR WrapperStruct00.var_1_10 [L74] unsigned long int stepLocal_0 = WrapperStruct00.var_1_10; [L75] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L75] COND FALSE !(WrapperStruct00.var_1_2) [L82] EXPR WrapperStruct00.var_1_8 [L82] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_8 [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L121] EXPR WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_10 >= (WrapperStruct00.var_1_10 / WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_7 + ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_9 + 63.25))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_9 + 63.25)))))))) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_8)) [L121] EXPR WrapperStruct00.var_1_1 [L121] EXPR WrapperStruct00.var_1_8 [L121] EXPR WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_10 >= (WrapperStruct00.var_1_10 / WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_7 + ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_9 + 63.25))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_9 + 63.25)))))))) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L121] EXPR (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_10 >= (WrapperStruct00.var_1_10 / WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_7 + ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_9 + 63.25))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_9 + 63.25)))))))) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_8))) && (((((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_12))) - WrapperStruct00.var_1_13) != (- last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_16))) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_10 == ((unsigned long int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L121] EXPR (WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_10 >= (WrapperStruct00.var_1_10 / WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_7 + ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_9 + 63.25))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_9 + 63.25)))))))) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_8))) && (((((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_12))) - WrapperStruct00.var_1_13) != (- last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_16))) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_10 == ((unsigned long int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L121] EXPR ((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_10 >= (WrapperStruct00.var_1_10 / WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_7 + ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_9 + 63.25))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_9 + 63.25)))))))) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_8))) && (((((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_12))) - WrapperStruct00.var_1_13) != (- last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_16))) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_10 == ((unsigned long int) WrapperStruct00.var_1_15)))) && ((WrapperStruct00.var_1_10 <= WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_10 == ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_12))))) ? ((WrapperStruct00.var_1_10 < WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_17 == ((unsigned long int) WrapperStruct00.var_1_15)) : 1) : 1) : (WrapperStruct00.var_1_17 == ((unsigned long int) WrapperStruct00.var_1_16))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L121] EXPR ((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_10 >= (WrapperStruct00.var_1_10 / WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_7 + ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_9 + 63.25))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_9 + 63.25)))))))) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_8))) && (((((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_12))) - WrapperStruct00.var_1_13) != (- last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_16))) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_10 == ((unsigned long int) WrapperStruct00.var_1_15)))) && ((WrapperStruct00.var_1_10 <= WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_10 == ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_12))))) ? ((WrapperStruct00.var_1_10 < WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_17 == ((unsigned long int) WrapperStruct00.var_1_15)) : 1) : 1) : (WrapperStruct00.var_1_17 == ((unsigned long int) WrapperStruct00.var_1_16))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L121-L122] return ((WrapperStruct00.var_1_2 ? ((WrapperStruct00.var_1_10 >= (WrapperStruct00.var_1_10 / WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_7 + ((((WrapperStruct00.var_1_8) > ((WrapperStruct00.var_1_9 + 63.25))) ? (WrapperStruct00.var_1_8) : ((WrapperStruct00.var_1_9 + 63.25)))))))) : (WrapperStruct00.var_1_1 == ((double) WrapperStruct00.var_1_8))) && (((((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_12))) - WrapperStruct00.var_1_13) != (- last_1_WrapperStruct00_var_1_17)) ? (WrapperStruct00.var_1_10 == ((unsigned long int) (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_16)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_16))) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_10 == ((unsigned long int) WrapperStruct00.var_1_15)))) && ((WrapperStruct00.var_1_10 <= WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_10 == ((((WrapperStruct00.var_1_16) > (WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_16) : (WrapperStruct00.var_1_12))))) ? ((WrapperStruct00.var_1_10 < WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_17 == ((unsigned long int) WrapperStruct00.var_1_15)) : 1) : 1) : (WrapperStruct00.var_1_17 == ((unsigned long int) WrapperStruct00.var_1_16))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_17=8] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_17=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 117 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 575 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 244 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 103 IncrementalHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 331 mSDtfsCounter, 103 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 434 NumberOfCodeBlocks, 434 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 296 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1368/1368 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:40:48,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...