/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-9.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:30:17,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:30:17,921 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-16 04:30:17,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:30:17,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:30:17,939 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:30:17,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:30:17,940 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:30:17,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:30:17,940 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:30:17,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:30:17,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:30:17,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:30:17,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:30:17,942 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:30:17,942 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:30:17,942 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:30:17,942 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:30:17,943 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:30:17,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:30:17,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:30:17,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:30:17,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:30:17,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:30:17,945 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:30:17,945 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:30:17,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:30:17,945 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:30:17,945 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:30:17,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:30:17,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:30:17,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:30:17,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:30:17,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:30:17,947 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:30:17,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:30:17,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:30:17,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:30:17,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:30:17,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:30:17,948 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:30:17,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:30:17,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:30:17,951 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 -> false [2023-12-16 04:30:18,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:30:18,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:30:18,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:30:18,160 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:30:18,160 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:30:18,161 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-9.i [2023-12-16 04:30:19,196 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:30:19,332 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:30:19,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-9.i [2023-12-16 04:30:19,346 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bfd6f6e8/956de1dc0029494b8946ef5c15a34142/FLAG34838e65b [2023-12-16 04:30:19,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3bfd6f6e8/956de1dc0029494b8946ef5c15a34142 [2023-12-16 04:30:19,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:30:19,358 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:30:19,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:30:19,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:30:19,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:30:19,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:30:19" (1/1) ... [2023-12-16 04:30:19,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d4b78d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:19, skipping insertion in model container [2023-12-16 04:30:19,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:30:19" (1/1) ... [2023-12-16 04:30:19,391 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:30:19,495 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-9.i[915,928] [2023-12-16 04:30:19,523 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:30:19,534 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:30:19,542 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-9.i[915,928] [2023-12-16 04:30:19,560 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:30:19,574 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:30:19,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:19 WrapperNode [2023-12-16 04:30:19,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:30:19,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:30:19,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:30:19,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:30:19,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:19" (1/1) ... [2023-12-16 04:30:19,592 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:19" (1/1) ... [2023-12-16 04:30:19,618 INFO L138 Inliner]: procedures = 29, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 334 [2023-12-16 04:30:19,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:30:19,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:30:19,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:30:19,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:30:19,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:19" (1/1) ... [2023-12-16 04:30:19,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:19" (1/1) ... [2023-12-16 04:30:19,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:19" (1/1) ... [2023-12-16 04:30:19,642 INFO L175 MemorySlicer]: Split 86 memory accesses to 2 slices as follows [2, 84]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2023-12-16 04:30:19,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:19" (1/1) ... [2023-12-16 04:30:19,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:19" (1/1) ... [2023-12-16 04:30:19,659 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:19" (1/1) ... [2023-12-16 04:30:19,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:19" (1/1) ... [2023-12-16 04:30:19,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:19" (1/1) ... [2023-12-16 04:30:19,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:19" (1/1) ... [2023-12-16 04:30:19,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:30:19,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:30:19,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:30:19,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:30:19,672 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:19" (1/1) ... [2023-12-16 04:30:19,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:30:19,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:19,699 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-16 04:30:19,716 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-16 04:30:19,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:30:19,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:30:19,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:30:19,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:30:19,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:30:19,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:30:19,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:30:19,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:30:19,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:30:19,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:30:19,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:30:19,739 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:30:19,739 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:30:19,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:30:19,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:30:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:30:19,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:30:19,840 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:30:19,842 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:30:20,123 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:30:20,159 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:30:20,160 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:30:20,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:30:20 BoogieIcfgContainer [2023-12-16 04:30:20,160 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:30:20,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:30:20,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:30:20,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:30:20,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:30:19" (1/3) ... [2023-12-16 04:30:20,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b638865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:30:20, skipping insertion in model container [2023-12-16 04:30:20,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:19" (2/3) ... [2023-12-16 04:30:20,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b638865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:30:20, skipping insertion in model container [2023-12-16 04:30:20,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:30:20" (3/3) ... [2023-12-16 04:30:20,165 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-9.i [2023-12-16 04:30:20,177 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:30:20,177 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:30:20,208 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:30:20,215 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;@4d83f6e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:30:20,215 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:30:20,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 04:30:20,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 04:30:20,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:20,230 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:30:20,231 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:20,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:20,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1101514449, now seen corresponding path program 1 times [2023-12-16 04:30:20,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:20,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312483038] [2023-12-16 04:30:20,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:20,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:20,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312483038] [2023-12-16 04:30:20,422 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-16 04:30:20,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73916305] [2023-12-16 04:30:20,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:20,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:20,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:20,425 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:30:20,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 04:30:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 04:30:20,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:30:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-16 04:30:20,577 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:30:20,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73916305] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:20,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:20,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:30:20,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955259653] [2023-12-16 04:30:20,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:20,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:30:20,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:20,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:30:20,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:30:20,603 INFO L87 Difference]: Start difference. First operand has 63 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 04:30:20,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:20,625 INFO L93 Difference]: Finished difference Result 123 states and 187 transitions. [2023-12-16 04:30:20,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:30:20,626 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2023-12-16 04:30:20,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:20,631 INFO L225 Difference]: With dead ends: 123 [2023-12-16 04:30:20,631 INFO L226 Difference]: Without dead ends: 61 [2023-12-16 04:30:20,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 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-16 04:30:20,635 INFO L413 NwaCegarLoop]: 83 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, 83 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-16 04:30:20,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:30:20,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-16 04:30:20,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-12-16 04:30:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 04:30:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2023-12-16 04:30:20,661 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 55 [2023-12-16 04:30:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:20,662 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2023-12-16 04:30:20,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-16 04:30:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2023-12-16 04:30:20,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 04:30:20,665 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:20,665 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:30:20,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 04:30:20,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-16 04:30:20,871 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:20,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:20,872 INFO L85 PathProgramCache]: Analyzing trace with hash 6585845, now seen corresponding path program 1 times [2023-12-16 04:30:20,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:20,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217042648] [2023-12-16 04:30:20,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:20,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:20,928 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:30:20,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1397619245] [2023-12-16 04:30:20,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:20,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:20,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:20,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:30:20,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 04:30:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 04:30:21,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:30:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 04:30:21,114 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:30:21,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:21,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217042648] [2023-12-16 04:30:21,114 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:30:21,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397619245] [2023-12-16 04:30:21,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397619245] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:21,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:21,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:30:21,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874613349] [2023-12-16 04:30:21,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:21,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:30:21,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:21,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:30:21,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:30:21,117 INFO L87 Difference]: Start difference. First operand 61 states and 87 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 04:30:21,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:21,172 INFO L93 Difference]: Finished difference Result 145 states and 208 transitions. [2023-12-16 04:30:21,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:30:21,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2023-12-16 04:30:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:21,175 INFO L225 Difference]: With dead ends: 145 [2023-12-16 04:30:21,175 INFO L226 Difference]: Without dead ends: 85 [2023-12-16 04:30:21,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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-16 04:30:21,176 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 48 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:21,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 249 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:30:21,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-16 04:30:21,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2023-12-16 04:30:21,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 04:30:21,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2023-12-16 04:30:21,182 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 55 [2023-12-16 04:30:21,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:21,184 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2023-12-16 04:30:21,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 04:30:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2023-12-16 04:30:21,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 04:30:21,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:21,185 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:30:21,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 04:30:21,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-16 04:30:21,395 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:21,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:21,395 INFO L85 PathProgramCache]: Analyzing trace with hash -386441165, now seen corresponding path program 1 times [2023-12-16 04:30:21,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:21,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11171040] [2023-12-16 04:30:21,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:21,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:21,421 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:30:21,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2103261745] [2023-12-16 04:30:21,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:21,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:21,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:21,423 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:30:21,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 04:30:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 04:30:21,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:30:21,553 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 04:30:21,554 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:30:21,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:21,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11171040] [2023-12-16 04:30:21,554 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:30:21,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103261745] [2023-12-16 04:30:21,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103261745] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:21,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:21,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:30:21,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394588152] [2023-12-16 04:30:21,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:21,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:30:21,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:21,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:30:21,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:30:21,556 INFO L87 Difference]: Start difference. First operand 63 states and 89 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 04:30:21,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:21,592 INFO L93 Difference]: Finished difference Result 145 states and 206 transitions. [2023-12-16 04:30:21,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:30:21,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2023-12-16 04:30:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:21,596 INFO L225 Difference]: With dead ends: 145 [2023-12-16 04:30:21,597 INFO L226 Difference]: Without dead ends: 83 [2023-12-16 04:30:21,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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-16 04:30:21,599 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 39 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:21,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 247 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:30:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-16 04:30:21,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2023-12-16 04:30:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 58 states have (on average 1.396551724137931) internal successors, (81), 58 states have internal predecessors, (81), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 04:30:21,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2023-12-16 04:30:21,613 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 55 [2023-12-16 04:30:21,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:21,614 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2023-12-16 04:30:21,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 04:30:21,614 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2023-12-16 04:30:21,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 04:30:21,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:21,615 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:30:21,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 04:30:21,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:21,819 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:21,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:21,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1195787791, now seen corresponding path program 1 times [2023-12-16 04:30:21,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:21,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94474781] [2023-12-16 04:30:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:21,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:21,842 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:30:21,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [62377431] [2023-12-16 04:30:21,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:21,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:21,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:21,845 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:30:21,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 04:30:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 04:30:21,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:30:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 04:30:21,946 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:30:21,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:21,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94474781] [2023-12-16 04:30:21,946 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:30:21,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62377431] [2023-12-16 04:30:21,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62377431] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:21,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:21,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:30:21,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014968184] [2023-12-16 04:30:21,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:21,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:30:21,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:21,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:30:21,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:30:21,947 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 04:30:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:21,969 INFO L93 Difference]: Finished difference Result 133 states and 186 transitions. [2023-12-16 04:30:21,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:30:21,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2023-12-16 04:30:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:21,970 INFO L225 Difference]: With dead ends: 133 [2023-12-16 04:30:21,970 INFO L226 Difference]: Without dead ends: 69 [2023-12-16 04:30:21,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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-16 04:30:21,971 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 3 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 237 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-16 04:30:21,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 237 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:30:21,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-16 04:30:21,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2023-12-16 04:30:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 60 states have internal predecessors, (83), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 04:30:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2023-12-16 04:30:21,975 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 55 [2023-12-16 04:30:21,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:21,975 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2023-12-16 04:30:21,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 04:30:21,976 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2023-12-16 04:30:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 04:30:21,976 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:21,976 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:30:21,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 04:30:22,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:22,181 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:22,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:22,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1195728209, now seen corresponding path program 1 times [2023-12-16 04:30:22,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:22,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172026271] [2023-12-16 04:30:22,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:22,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:22,201 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:30:22,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [832625627] [2023-12-16 04:30:22,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:22,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:22,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:22,202 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:30:22,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 04:30:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:22,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 04:30:22,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:30:22,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-12-16 04:30:22,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:22,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 28 [2023-12-16 04:30:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-16 04:30:22,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:30:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-16 04:30:22,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:22,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172026271] [2023-12-16 04:30:22,475 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:30:22,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832625627] [2023-12-16 04:30:22,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832625627] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 04:30:22,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 04:30:22,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2023-12-16 04:30:22,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493589135] [2023-12-16 04:30:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:22,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:30:22,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:22,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:30:22,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:30:22,479 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 04:30:22,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:22,622 INFO L93 Difference]: Finished difference Result 155 states and 215 transitions. [2023-12-16 04:30:22,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:30:22,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2023-12-16 04:30:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:22,624 INFO L225 Difference]: With dead ends: 155 [2023-12-16 04:30:22,624 INFO L226 Difference]: Without dead ends: 89 [2023-12-16 04:30:22,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:30:22,628 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 92 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:22,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 207 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:30:22,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-16 04:30:22,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 69. [2023-12-16 04:30:22,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 04:30:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2023-12-16 04:30:22,639 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 55 [2023-12-16 04:30:22,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:22,640 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2023-12-16 04:30:22,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-16 04:30:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2023-12-16 04:30:22,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-16 04:30:22,642 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:22,642 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:30:22,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-16 04:30:22,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:22,848 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:22,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:22,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1497772152, now seen corresponding path program 1 times [2023-12-16 04:30:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:22,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788561371] [2023-12-16 04:30:22,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:22,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:22,866 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:30:22,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1781358065] [2023-12-16 04:30:22,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:22,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:22,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:22,869 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:30:22,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-16 04:30:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:30:23,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:30:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:30:23,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:30:23,260 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:30:23,261 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:30:23,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-16 04:30:23,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:23,476 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-16 04:30:23,478 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:30:23,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:30:23 BoogieIcfgContainer [2023-12-16 04:30:23,517 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:30:23,517 INFO L158 Benchmark]: Toolchain (without parser) took 4158.97ms. Allocated memory was 194.0MB in the beginning and 248.5MB in the end (delta: 54.5MB). Free memory was 152.2MB in the beginning and 183.7MB in the end (delta: -31.5MB). Peak memory consumption was 24.0MB. Max. memory is 8.0GB. [2023-12-16 04:30:23,517 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:30:23,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.53ms. Allocated memory is still 194.0MB. Free memory was 151.8MB in the beginning and 137.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 04:30:23,518 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.11ms. Allocated memory is still 194.0MB. Free memory was 137.5MB in the beginning and 134.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:30:23,518 INFO L158 Benchmark]: Boogie Preprocessor took 49.98ms. Allocated memory is still 194.0MB. Free memory was 134.4MB in the beginning and 130.6MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:30:23,518 INFO L158 Benchmark]: RCFGBuilder took 488.62ms. Allocated memory is still 194.0MB. Free memory was 130.6MB in the beginning and 104.6MB in the end (delta: 26.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-16 04:30:23,518 INFO L158 Benchmark]: TraceAbstraction took 3355.40ms. Allocated memory was 194.0MB in the beginning and 248.5MB in the end (delta: 54.5MB). Free memory was 104.0MB in the beginning and 183.7MB in the end (delta: -79.8MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:30:23,519 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.10ms. Allocated memory is still 194.0MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.53ms. Allocated memory is still 194.0MB. Free memory was 151.8MB in the beginning and 137.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.11ms. Allocated memory is still 194.0MB. Free memory was 137.5MB in the beginning and 134.4MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.98ms. Allocated memory is still 194.0MB. Free memory was 134.4MB in the beginning and 130.6MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 488.62ms. Allocated memory is still 194.0MB. Free memory was 130.6MB in the beginning and 104.6MB in the end (delta: 26.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 3355.40ms. Allocated memory was 194.0MB in the beginning and 248.5MB in the end (delta: 54.5MB). Free memory was 104.0MB in the beginning and 183.7MB in the end (delta: -79.8MB). There was no memory consumed. 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 95, overapproximation of bitwise operation at line 95. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L45] unsigned char last_1_WrapperStruct0_var_1_1 = 10; [L46] double last_1_WrapperStruct0_var_1_10 = 9.2; [L47] signed short int last_1_WrapperStruct0_var_1_12 = 1; [L48] signed long int last_1_WrapperStruct0_var_1_14 = -16; [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L89] EXPR WrapperStruct0.var_1_1 [L89] last_1_WrapperStruct0_var_1_1 = WrapperStruct0.var_1_1 [L90] EXPR WrapperStruct0.var_1_10 [L90] last_1_WrapperStruct0_var_1_10 = WrapperStruct0.var_1_10 [L91] EXPR WrapperStruct0.var_1_12 [L91] last_1_WrapperStruct0_var_1_12 = WrapperStruct0.var_1_12 [L92] EXPR WrapperStruct0.var_1_14 [L92] last_1_WrapperStruct0_var_1_14 = WrapperStruct0.var_1_14 [L102] RET updateLastVariables() [L103] CALL updateVariables() [L79] WrapperStruct0.var_1_3 = __VERIFIER_nondet_uchar() [L80] EXPR WrapperStruct0.var_1_3 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L80] CALL assume_abort_if_not(WrapperStruct0.var_1_3 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L80] RET assume_abort_if_not(WrapperStruct0.var_1_3 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L81] EXPR WrapperStruct0.var_1_3 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L81] CALL assume_abort_if_not(WrapperStruct0.var_1_3 <= 254) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L81] RET assume_abort_if_not(WrapperStruct0.var_1_3 <= 254) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L82] WrapperStruct0.var_1_7 = __VERIFIER_nondet_uchar() [L83] EXPR WrapperStruct0.var_1_7 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L83] CALL assume_abort_if_not(WrapperStruct0.var_1_7 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L83] RET assume_abort_if_not(WrapperStruct0.var_1_7 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L84] EXPR WrapperStruct0.var_1_7 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L84] CALL assume_abort_if_not(WrapperStruct0.var_1_7 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L84] RET assume_abort_if_not(WrapperStruct0.var_1_7 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L85] WrapperStruct0.var_1_11 = __VERIFIER_nondet_double() [L86] EXPR WrapperStruct0.var_1_11 [L86] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L86] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F [L86] EXPR WrapperStruct0.var_1_11 [L86] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L86] EXPR (WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L86] EXPR (WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L86] CALL assume_abort_if_not((WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L86] RET assume_abort_if_not((WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L103] RET updateVariables() [L104] CALL step() [L52] unsigned char stepLocal_0 = last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10; VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10, stepLocal_0=0] [L53] COND FALSE !(((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || stepLocal_0) [L56] WrapperStruct0.var_1_12 = last_1_WrapperStruct0_var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L58] EXPR WrapperStruct0.var_1_12 [L58] WrapperStruct0.var_1_14 = WrapperStruct0.var_1_12 [L59] EXPR WrapperStruct0.var_1_12 [L59] EXPR 10 << WrapperStruct0.var_1_12 [L59] EXPR WrapperStruct0.var_1_3 [L59] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L59] COND TRUE (10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14) [L60] EXPR WrapperStruct0.var_1_12 [L60] EXPR WrapperStruct0.var_1_14 [L60] WrapperStruct0.var_1_8 = (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14) [L62] WrapperStruct0.var_1_9 = 64 [L63] EXPR WrapperStruct0.var_1_11 [L63] WrapperStruct0.var_1_10 = WrapperStruct0.var_1_11 [L64] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L64] COND TRUE WrapperStruct0.var_1_12 <= 16 [L65] EXPR WrapperStruct0.var_1_3 [L65] WrapperStruct0.var_1_1 = WrapperStruct0.var_1_3 [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) [L95] EXPR WrapperStruct0.var_1_1 [L95] EXPR WrapperStruct0.var_1_3 [L95] EXPR (WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1) [L95] EXPR WrapperStruct0.var_1_12 [L95] EXPR 10 << WrapperStruct0.var_1_12 [L95] EXPR WrapperStruct0.var_1_3 [L95] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1 [L95] EXPR WrapperStruct0.var_1_8 [L95] EXPR WrapperStruct0.var_1_12 [L95] EXPR WrapperStruct0.var_1_14 [L95] EXPR ((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64)) [L95] EXPR WrapperStruct0.var_1_9 [L95] EXPR (((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11)) [L95] EXPR WrapperStruct0.var_1_10 [L95] EXPR WrapperStruct0.var_1_11 [L95] EXPR ((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? (WrapperStruct0.var_1_12 == ((signed short int) ((((((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? (((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : (WrapperStruct0.var_1_12 == ((signed short int) last_1_WrapperStruct0_var_1_12))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? (WrapperStruct0.var_1_12 == ((signed short int) ((((((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? (((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : (WrapperStruct0.var_1_12 == ((signed short int) last_1_WrapperStruct0_var_1_12))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? (WrapperStruct0.var_1_12 == ((signed short int) ((((((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? (((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : (WrapperStruct0.var_1_12 == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && (WrapperStruct0.var_1_14 == ((signed long int) WrapperStruct0.var_1_12)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR ((((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? (WrapperStruct0.var_1_12 == ((signed short int) ((((((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? (((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : (WrapperStruct0.var_1_12 == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && (WrapperStruct0.var_1_14 == ((signed long int) WrapperStruct0.var_1_12)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95-L96] return ((((((WrapperStruct0.var_1_12 <= 16) ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : ((((((WrapperStruct0.var_1_10) > (WrapperStruct0.var_1_10)) ? (WrapperStruct0.var_1_10) : (WrapperStruct0.var_1_10))) < WrapperStruct0.var_1_10) ? (WrapperStruct0.var_1_7 ? (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3))) : (WrapperStruct0.var_1_1 == ((unsigned char) WrapperStruct0.var_1_3)))) && (((10 << WrapperStruct0.var_1_12) < (WrapperStruct0.var_1_3 * WrapperStruct0.var_1_14)) ? (WrapperStruct0.var_1_8 == ((signed short int) (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_14))) : 1)) && (WrapperStruct0.var_1_9 == ((unsigned char) 64))) && (WrapperStruct0.var_1_10 == ((double) WrapperStruct0.var_1_11))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? (WrapperStruct0.var_1_12 == ((signed short int) ((((((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? (((WrapperStruct0.var_1_3 + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : (WrapperStruct0.var_1_12 == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && (WrapperStruct0.var_1_14 == ((signed long int) WrapperStruct0.var_1_12)) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L19] reach_error() VAL [WrapperStruct0={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 182 mSDsluCounter, 1023 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 635 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 171 IncrementalHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 388 mSDtfsCounter, 171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 330 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 62 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 387 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 324 ConstructedInterpolants, 0 QuantifiedInterpolants, 399 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1258 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 228/240 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-16 04:30:23,533 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...