/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-sp_file-30.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 02:35:02,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 02:35:02,277 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-21 02:35:02,282 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 02:35:02,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 02:35:02,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 02:35:02,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 02:35:02,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 02:35:02,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 02:35:02,307 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 02:35:02,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 02:35:02,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 02:35:02,308 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 02:35:02,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 02:35:02,309 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 02:35:02,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 02:35:02,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 02:35:02,309 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 02:35:02,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 02:35:02,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 02:35:02,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 02:35:02,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 02:35:02,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 02:35:02,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 02:35:02,310 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 02:35:02,310 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 02:35:02,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 02:35:02,311 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 02:35:02,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 02:35:02,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 02:35:02,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 02:35:02,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 02:35:02,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:35:02,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 02:35:02,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 02:35:02,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 02:35:02,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 02:35:02,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 02:35:02,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 02:35:02,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 02:35:02,313 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 02:35:02,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 02:35:02,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 02:35:02,314 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-21 02:35:02,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 02:35:02,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 02:35:02,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 02:35:02,534 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 02:35:02,538 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 02:35:02,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-30.i [2023-12-21 02:35:03,612 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 02:35:03,787 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 02:35:03,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-30.i [2023-12-21 02:35:03,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eaf408eb/90ea49a7075740cd8471c6ebada1db21/FLAG493607709 [2023-12-21 02:35:03,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eaf408eb/90ea49a7075740cd8471c6ebada1db21 [2023-12-21 02:35:03,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 02:35:03,819 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 02:35:03,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 02:35:03,824 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 02:35:03,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 02:35:03,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:35:03" (1/1) ... [2023-12-21 02:35:03,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49bf1cb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:35:03, skipping insertion in model container [2023-12-21 02:35:03,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:35:03" (1/1) ... [2023-12-21 02:35:03,863 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 02:35:03,983 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-sp_file-30.i[917,930] [2023-12-21 02:35:04,045 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:35:04,063 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 02:35:04,070 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-sp_file-30.i[917,930] [2023-12-21 02:35:04,091 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 02:35:04,119 INFO L206 MainTranslator]: Completed translation [2023-12-21 02:35:04,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:35:04 WrapperNode [2023-12-21 02:35:04,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 02:35:04,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 02:35:04,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 02:35:04,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 02:35:04,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:35:04" (1/1) ... [2023-12-21 02:35:04,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:35:04" (1/1) ... [2023-12-21 02:35:04,178 INFO L138 Inliner]: procedures = 29, calls = 168, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 521 [2023-12-21 02:35:04,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 02:35:04,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 02:35:04,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 02:35:04,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 02:35:04,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:35:04" (1/1) ... [2023-12-21 02:35:04,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:35:04" (1/1) ... [2023-12-21 02:35:04,195 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:35:04" (1/1) ... [2023-12-21 02:35:04,209 INFO L175 MemorySlicer]: Split 139 memory accesses to 2 slices as follows [2, 137]. 99 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 13]. The 17 writes are split as follows [0, 17]. [2023-12-21 02:35:04,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:35:04" (1/1) ... [2023-12-21 02:35:04,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:35:04" (1/1) ... [2023-12-21 02:35:04,222 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:35:04" (1/1) ... [2023-12-21 02:35:04,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:35:04" (1/1) ... [2023-12-21 02:35:04,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:35:04" (1/1) ... [2023-12-21 02:35:04,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:35:04" (1/1) ... [2023-12-21 02:35:04,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 02:35:04,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 02:35:04,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 02:35:04,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 02:35:04,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:35:04" (1/1) ... [2023-12-21 02:35:04,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 02:35:04,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:35:04,270 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-21 02:35:04,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 02:35:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 02:35:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 02:35:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 02:35:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 02:35:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 02:35:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 02:35:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 02:35:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 02:35:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 02:35:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 02:35:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 02:35:04,294 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 02:35:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 02:35:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 02:35:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 02:35:04,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 02:35:04,296 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-21 02:35:04,438 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 02:35:04,440 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 02:35:04,816 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 02:35:04,853 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 02:35:04,853 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 02:35:04,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:35:04 BoogieIcfgContainer [2023-12-21 02:35:04,854 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 02:35:04,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 02:35:04,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 02:35:04,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 02:35:04,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:35:03" (1/3) ... [2023-12-21 02:35:04,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e84330d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:35:04, skipping insertion in model container [2023-12-21 02:35:04,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:35:04" (2/3) ... [2023-12-21 02:35:04,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e84330d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:35:04, skipping insertion in model container [2023-12-21 02:35:04,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:35:04" (3/3) ... [2023-12-21 02:35:04,860 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-30.i [2023-12-21 02:35:04,872 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 02:35:04,872 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 02:35:04,908 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 02:35:04,912 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;@77a1cfd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 02:35:04,912 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 02:35:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:35:04,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 02:35:04,927 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:35:04,928 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:35:04,930 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:35:04,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:35:04,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1341624602, now seen corresponding path program 1 times [2023-12-21 02:35:04,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:35:04,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975127428] [2023-12-21 02:35:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:04,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:35:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:35:05,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:35:05,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975127428] [2023-12-21 02:35:05,147 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-21 02:35:05,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743031163] [2023-12-21 02:35:05,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:05,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:35:05,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:35:05,162 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-21 02:35:05,184 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-21 02:35:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:35:05,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 02:35:05,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:35:05,383 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2023-12-21 02:35:05,383 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 02:35:05,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743031163] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:35:05,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:35:05,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 02:35:05,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106998538] [2023-12-21 02:35:05,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:35:05,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 02:35:05,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:35:05,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 02:35:05,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 02:35:05,421 INFO L87 Difference]: Start difference. First operand has 107 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 88 states have internal predecessors, (126), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 02:35:05,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:35:05,460 INFO L93 Difference]: Finished difference Result 211 states and 335 transitions. [2023-12-21 02:35:05,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 02:35:05,462 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2023-12-21 02:35:05,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:35:05,467 INFO L225 Difference]: With dead ends: 211 [2023-12-21 02:35:05,467 INFO L226 Difference]: Without dead ends: 105 [2023-12-21 02:35:05,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-21 02:35:05,471 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:35:05,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:35:05,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-21 02:35:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-12-21 02:35:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:35:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2023-12-21 02:35:05,500 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 130 [2023-12-21 02:35:05,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:35:05,501 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2023-12-21 02:35:05,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 02:35:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2023-12-21 02:35:05,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 02:35:05,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:35:05,503 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:35:05,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 02:35:05,709 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-21 02:35:05,710 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:35:05,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:35:05,711 INFO L85 PathProgramCache]: Analyzing trace with hash 335201420, now seen corresponding path program 1 times [2023-12-21 02:35:05,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:35:05,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780863446] [2023-12-21 02:35:05,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:05,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:35:05,792 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:35:05,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [231929441] [2023-12-21 02:35:05,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:05,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:35:05,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:35:05,801 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-21 02:35:05,826 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-21 02:35:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:35:06,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 02:35:06,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:35:06,068 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:35:06,068 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 02:35:06,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:35:06,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780863446] [2023-12-21 02:35:06,068 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:35:06,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231929441] [2023-12-21 02:35:06,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231929441] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:35:06,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:35:06,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 02:35:06,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276027549] [2023-12-21 02:35:06,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:35:06,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 02:35:06,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:35:06,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 02:35:06,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 02:35:06,071 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:35:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:35:06,132 INFO L93 Difference]: Finished difference Result 213 states and 314 transitions. [2023-12-21 02:35:06,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:35:06,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2023-12-21 02:35:06,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:35:06,135 INFO L225 Difference]: With dead ends: 213 [2023-12-21 02:35:06,135 INFO L226 Difference]: Without dead ends: 109 [2023-12-21 02:35:06,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 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-21 02:35:06,136 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 3 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:35:06,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 440 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:35:06,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-21 02:35:06,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2023-12-21 02:35:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 88 states have internal predecessors, (123), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:35:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 157 transitions. [2023-12-21 02:35:06,144 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 157 transitions. Word has length 130 [2023-12-21 02:35:06,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:35:06,145 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 157 transitions. [2023-12-21 02:35:06,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:35:06,146 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 157 transitions. [2023-12-21 02:35:06,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-21 02:35:06,147 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:35:06,147 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:35:06,163 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-21 02:35:06,367 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-21 02:35:06,368 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:35:06,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:35:06,370 INFO L85 PathProgramCache]: Analyzing trace with hash 335261002, now seen corresponding path program 1 times [2023-12-21 02:35:06,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:35:06,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647462684] [2023-12-21 02:35:06,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:06,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:35:06,416 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:35:06,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [757914591] [2023-12-21 02:35:06,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:06,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:35:06,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:35:06,418 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-21 02:35:06,468 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-21 02:35:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:35:06,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-21 02:35:06,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:35:08,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:08,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2023-12-21 02:35:08,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:08,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:08,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:08,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2023-12-21 02:35:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:35:08,908 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 02:35:08,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:35:08,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647462684] [2023-12-21 02:35:08,908 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:35:08,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757914591] [2023-12-21 02:35:08,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757914591] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:35:08,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:35:08,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:35:08,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11804842] [2023-12-21 02:35:08,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:35:08,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:35:08,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:35:08,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:35:08,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:35:08,910 INFO L87 Difference]: Start difference. First operand 107 states and 157 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:35:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:35:09,334 INFO L93 Difference]: Finished difference Result 262 states and 384 transitions. [2023-12-21 02:35:09,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:35:09,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2023-12-21 02:35:09,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:35:09,338 INFO L225 Difference]: With dead ends: 262 [2023-12-21 02:35:09,338 INFO L226 Difference]: Without dead ends: 156 [2023-12-21 02:35:09,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:35:09,340 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 213 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:35:09,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 290 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 330 Invalid, 3 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:35:09,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-21 02:35:09,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 113. [2023-12-21 02:35:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:35:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 166 transitions. [2023-12-21 02:35:09,350 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 166 transitions. Word has length 130 [2023-12-21 02:35:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:35:09,351 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 166 transitions. [2023-12-21 02:35:09,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:35:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 166 transitions. [2023-12-21 02:35:09,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 02:35:09,359 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:35:09,359 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:35:09,370 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-21 02:35:09,566 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-21 02:35:09,567 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:35:09,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:35:09,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1686122070, now seen corresponding path program 1 times [2023-12-21 02:35:09,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:35:09,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191446289] [2023-12-21 02:35:09,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:09,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:35:09,617 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:35:09,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [520296628] [2023-12-21 02:35:09,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:09,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:35:09,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:35:09,629 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-21 02:35:09,663 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-21 02:35:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:35:09,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-21 02:35:09,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:35:11,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:11,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2023-12-21 02:35:11,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:11,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:11,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:11,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2023-12-21 02:35:11,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:11,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:11,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:11,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:11,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:11,940 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-12-21 02:35:11,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2023-12-21 02:35:11,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:11,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:11,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:11,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2023-12-21 02:35:12,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:12,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2023-12-21 02:35:12,038 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:35:12,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:35:12,177 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_429 Int) (v_ArrVal_430 (Array Int Int))) (let ((.cse1 (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset (mod (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset) 256))))) (store .cse2 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_429))))) (or (let ((.cse0 (store .cse1 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_430))) (= (mod (select (select .cse0 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset) 256) (mod (select (select .cse0 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset) 256))) (not (= v_ArrVal_430 (store (select .cse1 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_430 c_~WrapperStruct00_var_1_16_Pointer~0.offset))))))) is different from false [2023-12-21 02:35:12,324 INFO L349 Elim1Store]: treesize reduction 139, result has 37.4 percent of original size [2023-12-21 02:35:12,324 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 285 treesize of output 115 [2023-12-21 02:35:12,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:35:12,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 167 treesize of output 199 [2023-12-21 02:35:12,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-12-21 02:35:12,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:35:12,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 209 treesize of output 201 [2023-12-21 02:35:13,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 165 [2023-12-21 02:35:14,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 165 [2023-12-21 02:35:16,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:35:16,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 750 treesize of output 690 [2023-12-21 02:35:16,758 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-21 02:35:16,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 385 treesize of output 353 [2023-12-21 02:35:17,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:35:17,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 355 treesize of output 321 [2023-12-21 02:35:17,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-12-21 02:35:17,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:35:17,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5270 treesize of output 4556 [2023-12-21 02:35:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:35:22,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:35:22,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191446289] [2023-12-21 02:35:22,158 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:35:22,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520296628] [2023-12-21 02:35:22,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520296628] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:35:22,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 02:35:22,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2023-12-21 02:35:22,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966336775] [2023-12-21 02:35:22,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:35:22,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:35:22,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:35:22,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:35:22,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=199, Unknown=11, NotChecked=30, Total=306 [2023-12-21 02:35:22,166 INFO L87 Difference]: Start difference. First operand 113 states and 166 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:35:28,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:35:28,856 INFO L93 Difference]: Finished difference Result 287 states and 419 transitions. [2023-12-21 02:35:28,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 02:35:28,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2023-12-21 02:35:28,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:35:28,863 INFO L225 Difference]: With dead ends: 287 [2023-12-21 02:35:28,863 INFO L226 Difference]: Without dead ends: 175 [2023-12-21 02:35:28,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 244 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=108, Invalid=344, Unknown=14, NotChecked=40, Total=506 [2023-12-21 02:35:28,869 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 437 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 15 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 243 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-21 02:35:28,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 513 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 338 Invalid, 18 Unknown, 243 Unchecked, 1.4s Time] [2023-12-21 02:35:28,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-21 02:35:28,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 122. [2023-12-21 02:35:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 103 states have internal predecessors, (145), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:35:28,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 179 transitions. [2023-12-21 02:35:28,894 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 179 transitions. Word has length 131 [2023-12-21 02:35:28,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:35:28,894 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 179 transitions. [2023-12-21 02:35:28,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:35:28,895 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2023-12-21 02:35:28,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 02:35:28,896 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:35:28,896 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:35:28,904 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-21 02:35:29,100 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-21 02:35:29,100 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:35:29,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:35:29,101 INFO L85 PathProgramCache]: Analyzing trace with hash -54507765, now seen corresponding path program 1 times [2023-12-21 02:35:29,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:35:29,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597308588] [2023-12-21 02:35:29,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:29,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:35:29,123 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:35:29,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [346779729] [2023-12-21 02:35:29,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:29,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:35:29,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:35:29,142 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-21 02:35:29,153 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-21 02:35:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:35:29,324 INFO L262 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-21 02:35:29,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:35:31,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:31,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2023-12-21 02:35:31,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:31,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:31,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:31,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2023-12-21 02:35:31,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:31,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:31,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:31,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2023-12-21 02:35:31,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:31,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:31,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:31,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2023-12-21 02:35:32,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:32,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2023-12-21 02:35:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:35:32,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:35:32,506 INFO L349 Elim1Store]: treesize reduction 135, result has 37.5 percent of original size [2023-12-21 02:35:32,506 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 249 treesize of output 113 [2023-12-21 02:35:32,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:35:32,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 197 [2023-12-21 02:35:32,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2023-12-21 02:35:33,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 191 [2023-12-21 02:35:33,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:35:33,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 366 treesize of output 332 [2023-12-21 02:35:33,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:35:33,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 512 treesize of output 440 [2023-12-21 02:35:34,062 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 02:35:34,065 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 02:35:34,190 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-21 02:35:34,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 428 treesize of output 367 [2023-12-21 02:35:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:35:37,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:35:37,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597308588] [2023-12-21 02:35:37,619 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:35:37,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346779729] [2023-12-21 02:35:37,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346779729] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:35:37,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 02:35:37,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2023-12-21 02:35:37,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598866830] [2023-12-21 02:35:37,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:35:37,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:35:37,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:35:37,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:35:37,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=194, Unknown=22, NotChecked=0, Total=272 [2023-12-21 02:35:37,624 INFO L87 Difference]: Start difference. First operand 122 states and 179 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:35:39,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:35:39,260 INFO L93 Difference]: Finished difference Result 305 states and 445 transitions. [2023-12-21 02:35:39,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 02:35:39,261 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2023-12-21 02:35:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:35:39,263 INFO L225 Difference]: With dead ends: 305 [2023-12-21 02:35:39,263 INFO L226 Difference]: Without dead ends: 184 [2023-12-21 02:35:39,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=340, Unknown=22, NotChecked=0, Total=462 [2023-12-21 02:35:39,264 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 522 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 24 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:35:39,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 560 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 439 Invalid, 2 Unknown, 0 Unchecked, 1.2s Time] [2023-12-21 02:35:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-12-21 02:35:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 122. [2023-12-21 02:35:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 103 states have internal predecessors, (145), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:35:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 179 transitions. [2023-12-21 02:35:39,282 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 179 transitions. Word has length 131 [2023-12-21 02:35:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:35:39,282 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 179 transitions. [2023-12-21 02:35:39,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:35:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2023-12-21 02:35:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-21 02:35:39,283 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:35:39,283 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:35:39,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-21 02:35:39,491 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-21 02:35:39,492 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:35:39,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:35:39,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1916471127, now seen corresponding path program 1 times [2023-12-21 02:35:39,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:35:39,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778275420] [2023-12-21 02:35:39,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:39,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:35:39,514 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:35:39,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [546928408] [2023-12-21 02:35:39,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:39,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:35:39,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:35:39,516 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-21 02:35:39,538 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-21 02:35:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:35:39,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-21 02:35:39,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:35:41,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:41,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:35:41,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:41,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:35:41,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-21 02:35:41,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:41,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-21 02:35:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:35:41,506 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 02:35:41,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:35:41,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778275420] [2023-12-21 02:35:41,506 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:35:41,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546928408] [2023-12-21 02:35:41,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546928408] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:35:41,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:35:41,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 02:35:41,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923193404] [2023-12-21 02:35:41,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:35:41,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:35:41,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:35:41,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:35:41,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-21 02:35:41,508 INFO L87 Difference]: Start difference. First operand 122 states and 179 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:35:41,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:35:41,983 INFO L93 Difference]: Finished difference Result 309 states and 452 transitions. [2023-12-21 02:35:41,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:35:41,984 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2023-12-21 02:35:41,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:35:41,985 INFO L225 Difference]: With dead ends: 309 [2023-12-21 02:35:41,985 INFO L226 Difference]: Without dead ends: 188 [2023-12-21 02:35:41,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-21 02:35:41,986 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 313 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 02:35:41,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 463 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 02:35:41,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-12-21 02:35:42,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 133. [2023-12-21 02:35:42,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 114 states have (on average 1.4210526315789473) internal successors, (162), 114 states have internal predecessors, (162), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:35:42,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 196 transitions. [2023-12-21 02:35:42,004 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 196 transitions. Word has length 131 [2023-12-21 02:35:42,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:35:42,005 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 196 transitions. [2023-12-21 02:35:42,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:35:42,005 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 196 transitions. [2023-12-21 02:35:42,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-21 02:35:42,006 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:35:42,006 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:35:42,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-21 02:35:42,215 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-21 02:35:42,215 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:35:42,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:35:42,216 INFO L85 PathProgramCache]: Analyzing trace with hash -739355285, now seen corresponding path program 1 times [2023-12-21 02:35:42,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:35:42,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644361646] [2023-12-21 02:35:42,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:42,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:35:42,255 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:35:42,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [177304326] [2023-12-21 02:35:42,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:42,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:35:42,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:35:42,261 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:35:42,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-21 02:35:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:35:42,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-21 02:35:42,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:35:44,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:44,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-21 02:35:44,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:44,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:44,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:44,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2023-12-21 02:35:44,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:44,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:44,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:44,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2023-12-21 02:35:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:35:44,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:35:44,325 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_751 (Array Int Int))) (or (not (= v_ArrVal_751 (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_751 c_~WrapperStruct00_var_1_16_Pointer~0.offset)))) (let ((.cse0 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_751))) (= (select (select .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset) (mod (select (select .cse0 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset) 256))))) is different from false [2023-12-21 02:35:44,334 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_749 Int) (v_ArrVal_751 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_749)))) (or (not (= v_ArrVal_751 (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_751 c_~WrapperStruct00_var_1_16_Pointer~0.offset)))) (let ((.cse1 (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_751))) (= (select (select .cse1 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset) (mod (select (select .cse1 c_~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset) 256)))))) is different from false [2023-12-21 02:35:44,492 INFO L349 Elim1Store]: treesize reduction 56, result has 50.0 percent of original size [2023-12-21 02:35:44,492 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 86 [2023-12-21 02:35:44,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:35:44,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 142 [2023-12-21 02:35:44,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:35:44,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 329 treesize of output 295 [2023-12-21 02:35:45,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 167 [2023-12-21 02:35:45,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:35:45,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1326 treesize of output 1114 [2023-12-21 02:35:46,638 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:35:46,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:35:46,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644361646] [2023-12-21 02:35:46,639 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:35:46,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177304326] [2023-12-21 02:35:46,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177304326] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:35:46,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 02:35:46,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 16 [2023-12-21 02:35:46,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98104533] [2023-12-21 02:35:46,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:35:46,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:35:46,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:35:46,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:35:46,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=145, Unknown=2, NotChecked=50, Total=240 [2023-12-21 02:35:46,641 INFO L87 Difference]: Start difference. First operand 133 states and 196 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:35:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:35:47,173 INFO L93 Difference]: Finished difference Result 333 states and 486 transitions. [2023-12-21 02:35:47,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 02:35:47,174 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2023-12-21 02:35:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:35:47,175 INFO L225 Difference]: With dead ends: 333 [2023-12-21 02:35:47,175 INFO L226 Difference]: Without dead ends: 201 [2023-12-21 02:35:47,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=334, Unknown=2, NotChecked=78, Total=506 [2023-12-21 02:35:47,176 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 304 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 449 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:35:47,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 525 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 258 Invalid, 0 Unknown, 449 Unchecked, 0.3s Time] [2023-12-21 02:35:47,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-12-21 02:35:47,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 169. [2023-12-21 02:35:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 150 states have (on average 1.42) internal successors, (213), 150 states have internal predecessors, (213), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:35:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 247 transitions. [2023-12-21 02:35:47,189 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 247 transitions. Word has length 133 [2023-12-21 02:35:47,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:35:47,189 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 247 transitions. [2023-12-21 02:35:47,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:35:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 247 transitions. [2023-12-21 02:35:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-21 02:35:47,190 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:35:47,190 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:35:47,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-21 02:35:47,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:35:47,391 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:35:47,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:35:47,392 INFO L85 PathProgramCache]: Analyzing trace with hash -744522862, now seen corresponding path program 1 times [2023-12-21 02:35:47,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:35:47,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597411963] [2023-12-21 02:35:47,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:47,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:35:47,411 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:35:47,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1627051809] [2023-12-21 02:35:47,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:47,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:35:47,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:35:47,412 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:35:47,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-21 02:35:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:35:47,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 02:35:47,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:35:47,615 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:35:47,615 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 02:35:47,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:35:47,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597411963] [2023-12-21 02:35:47,615 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:35:47,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627051809] [2023-12-21 02:35:47,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627051809] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:35:47,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:35:47,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:35:47,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932802176] [2023-12-21 02:35:47,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:35:47,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:35:47,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:35:47,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:35:47,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:35:47,617 INFO L87 Difference]: Start difference. First operand 169 states and 247 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:35:47,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:35:47,707 INFO L93 Difference]: Finished difference Result 366 states and 533 transitions. [2023-12-21 02:35:47,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:35:47,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2023-12-21 02:35:47,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:35:47,710 INFO L225 Difference]: With dead ends: 366 [2023-12-21 02:35:47,710 INFO L226 Difference]: Without dead ends: 198 [2023-12-21 02:35:47,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-21 02:35:47,711 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 61 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 02:35:47,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 617 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 02:35:47,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-12-21 02:35:47,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 171. [2023-12-21 02:35:47,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 152 states have (on average 1.4144736842105263) internal successors, (215), 152 states have internal predecessors, (215), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:35:47,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 249 transitions. [2023-12-21 02:35:47,726 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 249 transitions. Word has length 133 [2023-12-21 02:35:47,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:35:47,726 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 249 transitions. [2023-12-21 02:35:47,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:35:47,727 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 249 transitions. [2023-12-21 02:35:47,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-21 02:35:47,727 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:35:47,728 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:35:47,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-21 02:35:47,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-21 02:35:47,934 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:35:47,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:35:47,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1552618720, now seen corresponding path program 1 times [2023-12-21 02:35:47,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:35:47,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768481531] [2023-12-21 02:35:47,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:47,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:35:47,957 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:35:47,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1952039121] [2023-12-21 02:35:47,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:47,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:35:47,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:35:47,959 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:35:47,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-21 02:35:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:35:48,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-21 02:35:48,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:35:51,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:51,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2023-12-21 02:35:51,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:51,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:51,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:51,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:51,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:51,397 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 02:35:51,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2023-12-21 02:35:51,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:51,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:51,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:51,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:51,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:51,526 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 02:35:51,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2023-12-21 02:35:51,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:51,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:51,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:51,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:51,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:51,599 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-21 02:35:51,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 34 [2023-12-21 02:35:51,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:51,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:51,771 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:35:51,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 30 [2023-12-21 02:35:51,793 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:35:51,793 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 02:35:51,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:35:51,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768481531] [2023-12-21 02:35:51,793 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:35:51,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952039121] [2023-12-21 02:35:51,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952039121] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:35:51,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:35:51,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 02:35:51,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562413210] [2023-12-21 02:35:51,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:35:51,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 02:35:51,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:35:51,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 02:35:51,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-21 02:35:51,805 INFO L87 Difference]: Start difference. First operand 171 states and 249 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:35:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:35:53,089 INFO L93 Difference]: Finished difference Result 452 states and 647 transitions. [2023-12-21 02:35:53,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 02:35:53,098 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 133 [2023-12-21 02:35:53,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:35:53,099 INFO L225 Difference]: With dead ends: 452 [2023-12-21 02:35:53,099 INFO L226 Difference]: Without dead ends: 282 [2023-12-21 02:35:53,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2023-12-21 02:35:53,100 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 521 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-21 02:35:53,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 682 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-21 02:35:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-12-21 02:35:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 185. [2023-12-21 02:35:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 166 states have (on average 1.4096385542168675) internal successors, (234), 166 states have internal predecessors, (234), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:35:53,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 268 transitions. [2023-12-21 02:35:53,113 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 268 transitions. Word has length 133 [2023-12-21 02:35:53,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:35:53,114 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 268 transitions. [2023-12-21 02:35:53,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:35:53,114 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 268 transitions. [2023-12-21 02:35:53,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-21 02:35:53,115 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:35:53,115 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:35:53,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-21 02:35:53,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:35:53,324 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:35:53,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:35:53,324 INFO L85 PathProgramCache]: Analyzing trace with hash -495221699, now seen corresponding path program 1 times [2023-12-21 02:35:53,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:35:53,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92750485] [2023-12-21 02:35:53,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:53,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:35:53,367 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:35:53,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2054553908] [2023-12-21 02:35:53,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:35:53,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:35:53,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:35:53,374 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:35:53,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-21 02:35:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:35:53,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-21 02:35:53,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:35:56,656 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-21 02:35:56,656 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 1 case distinctions, treesize of input 15 treesize of output 15 [2023-12-21 02:35:56,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:56,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:56,819 INFO L349 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2023-12-21 02:35:56,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 36 [2023-12-21 02:35:57,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:57,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:57,055 INFO L349 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2023-12-21 02:35:57,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 48 [2023-12-21 02:35:57,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:57,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:35:57,150 INFO L349 Elim1Store]: treesize reduction 41, result has 21.2 percent of original size [2023-12-21 02:35:57,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 48 [2023-12-21 02:35:57,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:35:57,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 95 [2023-12-21 02:35:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:35:57,475 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 02:35:57,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:35:57,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92750485] [2023-12-21 02:35:57,475 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:35:57,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054553908] [2023-12-21 02:35:57,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054553908] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:35:57,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:35:57,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 02:35:57,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891787287] [2023-12-21 02:35:57,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:35:57,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 02:35:57,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:35:57,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 02:35:57,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-21 02:35:57,476 INFO L87 Difference]: Start difference. First operand 185 states and 268 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:35:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:35:59,819 INFO L93 Difference]: Finished difference Result 430 states and 617 transitions. [2023-12-21 02:35:59,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 02:35:59,820 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2023-12-21 02:35:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:35:59,821 INFO L225 Difference]: With dead ends: 430 [2023-12-21 02:35:59,821 INFO L226 Difference]: Without dead ends: 246 [2023-12-21 02:35:59,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-12-21 02:35:59,822 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 322 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-21 02:35:59,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 605 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 642 Invalid, 2 Unknown, 0 Unchecked, 1.7s Time] [2023-12-21 02:35:59,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-12-21 02:35:59,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 188. [2023-12-21 02:35:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 169 states have (on average 1.4023668639053255) internal successors, (237), 169 states have internal predecessors, (237), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:35:59,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 271 transitions. [2023-12-21 02:35:59,836 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 271 transitions. Word has length 135 [2023-12-21 02:35:59,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:35:59,836 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 271 transitions. [2023-12-21 02:35:59,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:35:59,836 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 271 transitions. [2023-12-21 02:35:59,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-21 02:35:59,837 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:35:59,837 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:35:59,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-21 02:36:00,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-21 02:36:00,038 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:00,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:00,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1226425742, now seen corresponding path program 1 times [2023-12-21 02:36:00,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:00,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093863498] [2023-12-21 02:36:00,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:00,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:00,061 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:36:00,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [258702341] [2023-12-21 02:36:00,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:00,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:00,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:36:00,062 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:36:00,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-21 02:36:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:00,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-21 02:36:00,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:36:02,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:02,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-21 02:36:02,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:02,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:02,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:02,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2023-12-21 02:36:02,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:02,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:02,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:02,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2023-12-21 02:36:02,330 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:36:02,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:36:02,396 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1186 (Array Int Int))) (or (not (= (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1186 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_1186)) (let ((.cse0 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1186))) (= (mod (select (select .cse0 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset) 256) (select (select .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset))))) is different from false [2023-12-21 02:36:02,407 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1184 Int) (v_ArrVal_1186 (Array Int Int))) (let ((.cse1 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1184)))) (or (let ((.cse0 (store .cse1 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1186))) (= (mod (select (select .cse0 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset) 256) (select (select .cse0 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset))) (not (= (store (select .cse1 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1186 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_1186))))) is different from false [2023-12-21 02:36:02,491 INFO L349 Elim1Store]: treesize reduction 56, result has 50.0 percent of original size [2023-12-21 02:36:02,492 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 139 treesize of output 86 [2023-12-21 02:36:02,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:36:02,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 142 [2023-12-21 02:36:02,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2023-12-21 02:36:02,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2023-12-21 02:36:03,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:36:03,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 307 treesize of output 275 [2023-12-21 02:36:03,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:36:03,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 889 treesize of output 771 [2023-12-21 02:36:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:36:04,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:04,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093863498] [2023-12-21 02:36:04,679 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:36:04,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258702341] [2023-12-21 02:36:04,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258702341] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:36:04,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 02:36:04,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 18 [2023-12-21 02:36:04,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555225734] [2023-12-21 02:36:04,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:04,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 02:36:04,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:04,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 02:36:04,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=198, Unknown=2, NotChecked=58, Total=306 [2023-12-21 02:36:04,681 INFO L87 Difference]: Start difference. First operand 188 states and 271 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:05,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:05,289 INFO L93 Difference]: Finished difference Result 460 states and 660 transitions. [2023-12-21 02:36:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 02:36:05,289 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2023-12-21 02:36:05,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:05,291 INFO L225 Difference]: With dead ends: 460 [2023-12-21 02:36:05,291 INFO L226 Difference]: Without dead ends: 273 [2023-12-21 02:36:05,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=448, Unknown=2, NotChecked=90, Total=650 [2023-12-21 02:36:05,292 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 247 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 452 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:05,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 771 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 371 Invalid, 0 Unknown, 452 Unchecked, 0.4s Time] [2023-12-21 02:36:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-12-21 02:36:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 239. [2023-12-21 02:36:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 220 states have (on average 1.4136363636363636) internal successors, (311), 220 states have internal predecessors, (311), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:36:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 345 transitions. [2023-12-21 02:36:05,308 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 345 transitions. Word has length 135 [2023-12-21 02:36:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:05,308 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 345 transitions. [2023-12-21 02:36:05,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 345 transitions. [2023-12-21 02:36:05,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-21 02:36:05,309 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:05,309 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:36:05,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-21 02:36:05,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-21 02:36:05,517 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:05,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:05,517 INFO L85 PathProgramCache]: Analyzing trace with hash -404608232, now seen corresponding path program 1 times [2023-12-21 02:36:05,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:05,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579596377] [2023-12-21 02:36:05,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:05,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:05,536 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:36:05,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1229543967] [2023-12-21 02:36:05,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:05,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:05,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:36:05,537 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:36:05,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-21 02:36:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:05,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-21 02:36:05,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:36:08,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:08,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:08,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:08,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:08,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:08,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-21 02:36:08,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:08,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-21 02:36:08,352 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:36:08,352 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:36:08,375 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1297 (Array Int Int))) (or (not (= v_ArrVal_1297 (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1297 c_~WrapperStruct00_var_1_16_Pointer~0.offset)))) (not (= (mod (select (select (store |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1297) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)))) is different from false [2023-12-21 02:36:08,403 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1295 Int) (v_ArrVal_1297 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1295)))) (or (not (= (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1297 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_1297)) (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1297) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0))))) is different from false [2023-12-21 02:36:08,431 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1295 Int) (v_ArrVal_1297 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1293)))) (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1295))))) (or (not (= (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1297 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_1297)) (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1297) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0))))) is different from false [2023-12-21 02:36:08,454 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1293 Int) (v_ArrVal_1295 Int) (v_ArrVal_1297 (Array Int Int)) (v_ArrVal_1291 Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_1291)))) (store .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1293))))) (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1295))))) (or (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1297) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= v_ArrVal_1297 (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1297 c_~WrapperStruct00_var_1_16_Pointer~0.offset))))))) is different from false [2023-12-21 02:36:08,648 INFO L349 Elim1Store]: treesize reduction 126, result has 41.7 percent of original size [2023-12-21 02:36:08,648 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 146 treesize of output 119 [2023-12-21 02:36:08,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:36:08,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 159 [2023-12-21 02:36:08,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2023-12-21 02:36:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:36:09,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:09,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579596377] [2023-12-21 02:36:09,640 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:36:09,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229543967] [2023-12-21 02:36:09,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229543967] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:36:09,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 02:36:09,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2023-12-21 02:36:09,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732027075] [2023-12-21 02:36:09,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:09,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:36:09,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:09,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:36:09,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=120, Unknown=4, NotChecked=100, Total=272 [2023-12-21 02:36:09,642 INFO L87 Difference]: Start difference. First operand 239 states and 345 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:10,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:10,427 INFO L93 Difference]: Finished difference Result 565 states and 809 transitions. [2023-12-21 02:36:10,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 02:36:10,429 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2023-12-21 02:36:10,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:10,430 INFO L225 Difference]: With dead ends: 565 [2023-12-21 02:36:10,430 INFO L226 Difference]: Without dead ends: 327 [2023-12-21 02:36:10,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 252 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=213, Unknown=4, NotChecked=132, Total=420 [2023-12-21 02:36:10,431 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 222 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1021 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:10,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 352 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 246 Invalid, 1 Unknown, 1021 Unchecked, 0.5s Time] [2023-12-21 02:36:10,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-12-21 02:36:10,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 247. [2023-12-21 02:36:10,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 228 states have (on average 1.4166666666666667) internal successors, (323), 228 states have internal predecessors, (323), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:36:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 357 transitions. [2023-12-21 02:36:10,449 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 357 transitions. Word has length 135 [2023-12-21 02:36:10,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:10,449 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 357 transitions. [2023-12-21 02:36:10,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:10,450 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 357 transitions. [2023-12-21 02:36:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-21 02:36:10,450 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:10,451 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:36:10,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-21 02:36:10,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-21 02:36:10,658 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:10,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:10,659 INFO L85 PathProgramCache]: Analyzing trace with hash -146442794, now seen corresponding path program 1 times [2023-12-21 02:36:10,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:10,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212051928] [2023-12-21 02:36:10,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:10,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:10,684 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:36:10,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [945808363] [2023-12-21 02:36:10,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:10,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:10,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:36:10,686 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:36:10,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-21 02:36:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:10,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-21 02:36:10,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:36:12,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:12,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:12,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:12,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-21 02:36:12,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:12,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-21 02:36:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:36:12,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:36:12,829 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1398 (Array Int Int))) (or (not (= (mod (select (select (store |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1398) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= v_ArrVal_1398 (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1398 c_~WrapperStruct00_var_1_16_Pointer~0.offset)))))) is different from false [2023-12-21 02:36:12,852 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1397 Int) (v_ArrVal_1398 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1397)))) (or (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1398) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= v_ArrVal_1398 (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1398 c_~WrapperStruct00_var_1_16_Pointer~0.offset))))))) is different from false [2023-12-21 02:36:12,867 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1394 Int) (v_ArrVal_1397 Int) (v_ArrVal_1398 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_1394)))) (store .cse1 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1397))))) (or (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1398) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1398 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_1398))))) is different from false [2023-12-21 02:36:12,898 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1394 Int) (v_ArrVal_1397 Int) (v_ArrVal_1398 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_1394)))) (store .cse1 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1397))))) (or (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1398) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1398 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_1398))))) (= (mod |c_ULTIMATE.start_step_#t~mem6#1| 256) 0)) is different from false [2023-12-21 02:36:12,968 INFO L349 Elim1Store]: treesize reduction 54, result has 50.0 percent of original size [2023-12-21 02:36:12,968 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 83 [2023-12-21 02:36:12,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:36:12,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 105 [2023-12-21 02:36:13,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 76 [2023-12-21 02:36:13,736 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:36:13,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:13,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212051928] [2023-12-21 02:36:13,736 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:36:13,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945808363] [2023-12-21 02:36:13,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945808363] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:36:13,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 02:36:13,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2023-12-21 02:36:13,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797019403] [2023-12-21 02:36:13,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:13,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:36:13,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:13,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:36:13,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=83, Unknown=4, NotChecked=84, Total=210 [2023-12-21 02:36:13,739 INFO L87 Difference]: Start difference. First operand 247 states and 357 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:14,032 INFO L93 Difference]: Finished difference Result 533 states and 768 transitions. [2023-12-21 02:36:14,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:36:14,032 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2023-12-21 02:36:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:14,034 INFO L225 Difference]: With dead ends: 533 [2023-12-21 02:36:14,034 INFO L226 Difference]: Without dead ends: 287 [2023-12-21 02:36:14,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 254 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=141, Unknown=4, NotChecked=108, Total=306 [2023-12-21 02:36:14,035 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 154 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 776 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:14,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 256 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 776 Unchecked, 0.1s Time] [2023-12-21 02:36:14,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-12-21 02:36:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 246. [2023-12-21 02:36:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 227 states have (on average 1.4140969162995596) internal successors, (321), 227 states have internal predecessors, (321), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:36:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 355 transitions. [2023-12-21 02:36:14,053 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 355 transitions. Word has length 135 [2023-12-21 02:36:14,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:14,053 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 355 transitions. [2023-12-21 02:36:14,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 355 transitions. [2023-12-21 02:36:14,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-21 02:36:14,054 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:14,054 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:36:14,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-21 02:36:14,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-21 02:36:14,261 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:14,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:14,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1222256682, now seen corresponding path program 1 times [2023-12-21 02:36:14,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:14,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397880212] [2023-12-21 02:36:14,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:14,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:14,285 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:36:14,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2082119495] [2023-12-21 02:36:14,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:14,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:14,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:36:14,286 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:36:14,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-21 02:36:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:14,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-21 02:36:14,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:36:16,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:16,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:16,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:17,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:17,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:17,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-21 02:36:17,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:17,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-21 02:36:17,060 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:36:17,060 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:36:17,074 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1509 (Array Int Int))) (or (not (= (mod (select (select (store |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1509) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= v_ArrVal_1509 (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1509 c_~WrapperStruct00_var_1_16_Pointer~0.offset)))))) is different from false [2023-12-21 02:36:17,081 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1507 Int) (v_ArrVal_1509 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1507)))) (or (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1509) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1509 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_1509))))) is different from false [2023-12-21 02:36:17,102 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1507 Int) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1505 Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1505)))) (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1507))))) (or (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1509) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= v_ArrVal_1509 (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1509 c_~WrapperStruct00_var_1_16_Pointer~0.offset))))))) is different from false [2023-12-21 02:36:17,118 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1507 Int) (v_ArrVal_1503 Int) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1505 Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_1503)))) (store .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1505))))) (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1507))))) (or (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1509) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= v_ArrVal_1509 (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1509 c_~WrapperStruct00_var_1_16_Pointer~0.offset))))))) is different from false [2023-12-21 02:36:17,174 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1507 Int) (v_ArrVal_1503 Int) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1505 Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_1503)))) (store .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1505))))) (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1507))))) (or (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1509) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= v_ArrVal_1509 (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1509 c_~WrapperStruct00_var_1_16_Pointer~0.offset))))))) (= (mod |c_ULTIMATE.start_step_#t~mem6#1| 256) 0)) is different from false [2023-12-21 02:36:17,261 INFO L349 Elim1Store]: treesize reduction 126, result has 41.7 percent of original size [2023-12-21 02:36:17,262 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 146 treesize of output 119 [2023-12-21 02:36:17,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:36:17,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 159 [2023-12-21 02:36:17,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2023-12-21 02:36:18,261 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:36:18,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:18,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397880212] [2023-12-21 02:36:18,261 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:36:18,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082119495] [2023-12-21 02:36:18,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082119495] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:36:18,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 02:36:18,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2023-12-21 02:36:18,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729739786] [2023-12-21 02:36:18,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:18,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:36:18,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:18,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:36:18,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=101, Unknown=5, NotChecked=120, Total=272 [2023-12-21 02:36:18,263 INFO L87 Difference]: Start difference. First operand 246 states and 355 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:18,600 INFO L93 Difference]: Finished difference Result 537 states and 773 transitions. [2023-12-21 02:36:18,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:36:18,601 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2023-12-21 02:36:18,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:18,602 INFO L225 Difference]: With dead ends: 537 [2023-12-21 02:36:18,602 INFO L226 Difference]: Without dead ends: 292 [2023-12-21 02:36:18,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 252 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=165, Unknown=5, NotChecked=150, Total=380 [2023-12-21 02:36:18,603 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 150 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 973 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:18,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 252 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 973 Unchecked, 0.1s Time] [2023-12-21 02:36:18,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-12-21 02:36:18,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 252. [2023-12-21 02:36:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 233 states have (on average 1.4163090128755365) internal successors, (330), 233 states have internal predecessors, (330), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:36:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 364 transitions. [2023-12-21 02:36:18,619 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 364 transitions. Word has length 135 [2023-12-21 02:36:18,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:18,620 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 364 transitions. [2023-12-21 02:36:18,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 364 transitions. [2023-12-21 02:36:18,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-21 02:36:18,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:18,620 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:36:18,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-21 02:36:18,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:18,827 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:18,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:18,828 INFO L85 PathProgramCache]: Analyzing trace with hash -964091244, now seen corresponding path program 1 times [2023-12-21 02:36:18,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:18,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27325960] [2023-12-21 02:36:18,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:18,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:18,851 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:36:18,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1753356714] [2023-12-21 02:36:18,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:18,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:18,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:36:18,853 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:36:18,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-21 02:36:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:19,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-21 02:36:19,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:36:20,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:20,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:20,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:20,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-21 02:36:20,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:20,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-21 02:36:20,973 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:36:20,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:36:20,989 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1610 (Array Int Int))) (or (not (= 0 (mod (select (select (store |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1610) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256))) (not (= v_ArrVal_1610 (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1610 c_~WrapperStruct00_var_1_16_Pointer~0.offset)))))) is different from false [2023-12-21 02:36:21,006 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1609 Int) (v_ArrVal_1610 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1609)))) (or (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1610) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1610 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_1610))))) is different from false [2023-12-21 02:36:21,020 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1606 Int) (v_ArrVal_1609 Int) (v_ArrVal_1610 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_1606)))) (store .cse1 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1609))))) (or (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1610) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= v_ArrVal_1610 (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1610 c_~WrapperStruct00_var_1_16_Pointer~0.offset))))))) is different from false [2023-12-21 02:36:21,053 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod |c_ULTIMATE.start_step_#t~mem6#1| 256) 0) (forall ((v_ArrVal_1606 Int) (v_ArrVal_1609 Int) (v_ArrVal_1610 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_1606)))) (store .cse1 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1609))))) (or (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1610) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= v_ArrVal_1610 (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1610 c_~WrapperStruct00_var_1_16_Pointer~0.offset)))))))) is different from false [2023-12-21 02:36:21,122 INFO L349 Elim1Store]: treesize reduction 54, result has 50.0 percent of original size [2023-12-21 02:36:21,123 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 83 [2023-12-21 02:36:21,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:36:21,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 105 [2023-12-21 02:36:21,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 76 [2023-12-21 02:36:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:36:21,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:21,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27325960] [2023-12-21 02:36:21,701 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:36:21,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753356714] [2023-12-21 02:36:21,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753356714] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:36:21,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 02:36:21,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2023-12-21 02:36:21,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031386616] [2023-12-21 02:36:21,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:21,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 02:36:21,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:21,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 02:36:21,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=83, Unknown=4, NotChecked=84, Total=210 [2023-12-21 02:36:21,702 INFO L87 Difference]: Start difference. First operand 252 states and 364 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:21,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:21,965 INFO L93 Difference]: Finished difference Result 543 states and 782 transitions. [2023-12-21 02:36:21,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:36:21,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2023-12-21 02:36:21,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:21,967 INFO L225 Difference]: With dead ends: 543 [2023-12-21 02:36:21,967 INFO L226 Difference]: Without dead ends: 292 [2023-12-21 02:36:21,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 254 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=141, Unknown=4, NotChecked=108, Total=306 [2023-12-21 02:36:21,968 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 150 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 776 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:21,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 262 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 776 Unchecked, 0.1s Time] [2023-12-21 02:36:21,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-12-21 02:36:21,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 244. [2023-12-21 02:36:21,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 225 states have (on average 1.4133333333333333) internal successors, (318), 225 states have internal predecessors, (318), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:36:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 352 transitions. [2023-12-21 02:36:21,987 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 352 transitions. Word has length 135 [2023-12-21 02:36:21,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:21,987 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 352 transitions. [2023-12-21 02:36:21,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:21,988 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 352 transitions. [2023-12-21 02:36:21,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-21 02:36:21,990 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:21,990 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:36:21,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-21 02:36:22,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-21 02:36:22,197 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:22,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash 205288008, now seen corresponding path program 1 times [2023-12-21 02:36:22,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:22,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786929263] [2023-12-21 02:36:22,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:22,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:22,232 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:36:22,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332253895] [2023-12-21 02:36:22,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:22,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:22,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:36:22,233 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:36:22,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-21 02:36:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:22,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-21 02:36:22,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:36:22,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-21 02:36:22,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-21 02:36:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:36:22,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:36:23,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2023-12-21 02:36:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:36:23,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:23,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786929263] [2023-12-21 02:36:23,217 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:36:23,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332253895] [2023-12-21 02:36:23,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332253895] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:36:23,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 02:36:23,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2023-12-21 02:36:23,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266288078] [2023-12-21 02:36:23,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:23,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 02:36:23,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:23,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 02:36:23,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-21 02:36:23,218 INFO L87 Difference]: Start difference. First operand 244 states and 352 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:23,596 INFO L93 Difference]: Finished difference Result 464 states and 670 transitions. [2023-12-21 02:36:23,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:36:23,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2023-12-21 02:36:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:23,597 INFO L225 Difference]: With dead ends: 464 [2023-12-21 02:36:23,597 INFO L226 Difference]: Without dead ends: 221 [2023-12-21 02:36:23,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-12-21 02:36:23,598 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 118 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:23,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 385 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:36:23,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-12-21 02:36:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2023-12-21 02:36:23,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 201 states have (on average 1.407960199004975) internal successors, (283), 201 states have internal predecessors, (283), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:36:23,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 317 transitions. [2023-12-21 02:36:23,614 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 317 transitions. Word has length 136 [2023-12-21 02:36:23,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:23,615 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 317 transitions. [2023-12-21 02:36:23,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 317 transitions. [2023-12-21 02:36:23,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-21 02:36:23,616 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:23,616 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:36:23,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-21 02:36:23,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-21 02:36:23,819 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:23,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:23,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1505496611, now seen corresponding path program 1 times [2023-12-21 02:36:23,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:23,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173013337] [2023-12-21 02:36:23,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:23,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:23,837 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:36:23,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [127059141] [2023-12-21 02:36:23,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:23,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:23,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:36:23,838 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:36:23,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-21 02:36:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 02:36:24,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:36:24,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-21 02:36:24,120 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:36:24,120 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 02:36:24,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:24,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173013337] [2023-12-21 02:36:24,120 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:36:24,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127059141] [2023-12-21 02:36:24,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127059141] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 02:36:24,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 02:36:24,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 02:36:24,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152774877] [2023-12-21 02:36:24,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:24,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 02:36:24,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:24,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 02:36:24,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 02:36:24,122 INFO L87 Difference]: Start difference. First operand 220 states and 317 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:24,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:24,303 INFO L93 Difference]: Finished difference Result 438 states and 632 transitions. [2023-12-21 02:36:24,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 02:36:24,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2023-12-21 02:36:24,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:24,304 INFO L225 Difference]: With dead ends: 438 [2023-12-21 02:36:24,304 INFO L226 Difference]: Without dead ends: 219 [2023-12-21 02:36:24,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 02:36:24,305 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 18 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:24,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 472 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 02:36:24,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-12-21 02:36:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2023-12-21 02:36:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 194 states have (on average 1.402061855670103) internal successors, (272), 194 states have internal predecessors, (272), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:36:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 306 transitions. [2023-12-21 02:36:24,321 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 306 transitions. Word has length 136 [2023-12-21 02:36:24,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:24,323 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 306 transitions. [2023-12-21 02:36:24,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 306 transitions. [2023-12-21 02:36:24,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-21 02:36:24,324 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:24,324 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:36:24,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-21 02:36:24,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-21 02:36:24,531 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:24,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:24,532 INFO L85 PathProgramCache]: Analyzing trace with hash 225012296, now seen corresponding path program 1 times [2023-12-21 02:36:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:24,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349006] [2023-12-21 02:36:24,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:24,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:24,553 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:36:24,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107530002] [2023-12-21 02:36:24,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:24,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:24,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:36:24,554 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:36:24,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-12-21 02:36:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:24,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-21 02:36:24,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:36:27,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:27,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:27,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:27,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:27,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:27,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-21 02:36:27,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:27,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-21 02:36:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:36:27,492 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:36:27,514 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1915 (Array Int Int))) (or (not (= v_ArrVal_1915 (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1915 c_~WrapperStruct00_var_1_16_Pointer~0.offset)))) (not (= (mod (select (select (store |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1915) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)))) is different from false [2023-12-21 02:36:27,522 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1913 Int) (v_ArrVal_1915 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1913)))) (or (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1915) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= v_ArrVal_1915 (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1915 c_~WrapperStruct00_var_1_16_Pointer~0.offset))))))) is different from false [2023-12-21 02:36:27,563 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1913 Int) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1912 Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1912)))) (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1913))))) (or (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1915) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1915 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_1915))))) is different from false [2023-12-21 02:36:27,596 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1913 Int) (v_ArrVal_1910 Int) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1912 Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_1910)))) (store .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1912))))) (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1913))))) (or (not (= (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1915 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_1915)) (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1915) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0))))) is different from false [2023-12-21 02:36:27,663 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod |c_ULTIMATE.start_step_#t~mem6#1| 256) 0) (forall ((v_ArrVal_1913 Int) (v_ArrVal_1910 Int) (v_ArrVal_1915 (Array Int Int)) (v_ArrVal_1912 Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_1910)))) (store .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1912))))) (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_1913))))) (or (not (= (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_1915 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_1915)) (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_1915) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)))))) is different from false [2023-12-21 02:36:27,783 INFO L349 Elim1Store]: treesize reduction 126, result has 41.7 percent of original size [2023-12-21 02:36:27,783 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 146 treesize of output 119 [2023-12-21 02:36:27,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:36:27,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 163 [2023-12-21 02:36:27,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 85 [2023-12-21 02:36:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:36:28,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:28,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349006] [2023-12-21 02:36:28,689 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:36:28,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107530002] [2023-12-21 02:36:28,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107530002] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:36:28,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 02:36:28,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2023-12-21 02:36:28,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907271175] [2023-12-21 02:36:28,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:28,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:36:28,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:28,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:36:28,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=101, Unknown=5, NotChecked=120, Total=272 [2023-12-21 02:36:28,690 INFO L87 Difference]: Start difference. First operand 213 states and 306 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:28,981 INFO L93 Difference]: Finished difference Result 471 states and 676 transitions. [2023-12-21 02:36:28,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:36:28,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2023-12-21 02:36:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:28,983 INFO L225 Difference]: With dead ends: 471 [2023-12-21 02:36:28,983 INFO L226 Difference]: Without dead ends: 259 [2023-12-21 02:36:28,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 254 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=165, Unknown=5, NotChecked=150, Total=380 [2023-12-21 02:36:28,984 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 154 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 977 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:28,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 248 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 977 Unchecked, 0.1s Time] [2023-12-21 02:36:28,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-12-21 02:36:29,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 221. [2023-12-21 02:36:29,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 202 states have (on average 1.4059405940594059) internal successors, (284), 202 states have internal predecessors, (284), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:36:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 318 transitions. [2023-12-21 02:36:29,001 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 318 transitions. Word has length 136 [2023-12-21 02:36:29,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:29,001 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 318 transitions. [2023-12-21 02:36:29,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 318 transitions. [2023-12-21 02:36:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-21 02:36:29,002 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:29,002 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:36:29,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-12-21 02:36:29,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-21 02:36:29,210 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:29,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:29,211 INFO L85 PathProgramCache]: Analyzing trace with hash -361793718, now seen corresponding path program 1 times [2023-12-21 02:36:29,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:29,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811003448] [2023-12-21 02:36:29,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:29,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:29,229 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:36:29,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1411658757] [2023-12-21 02:36:29,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:29,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:29,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:36:29,231 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:36:29,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-21 02:36:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:29,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-21 02:36:29,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:36:31,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:31,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:31,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:31,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:31,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:31,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-21 02:36:31,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:32,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-21 02:36:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:36:32,014 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:36:32,034 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2026 (Array Int Int))) (or (not (= (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_2026 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_2026)) (not (= (mod (select (select (store |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_2026) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)))) is different from false [2023-12-21 02:36:32,047 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2024 Int) (v_ArrVal_2026 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_2024)))) (or (not (= v_ArrVal_2026 (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_2026 c_~WrapperStruct00_var_1_16_Pointer~0.offset)))) (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_2026) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0))))) is different from false [2023-12-21 02:36:32,083 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 Int) (v_ArrVal_2024 Int) (v_ArrVal_2026 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_2023)))) (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_2024))))) (or (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_2026) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_2026 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_2026))))) is different from false [2023-12-21 02:36:32,109 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2021 Int) (v_ArrVal_2023 Int) (v_ArrVal_2024 Int) (v_ArrVal_2026 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_2021)))) (store .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_2023))))) (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_2024))))) (or (not (= (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_2026 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_2026)) (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_2026) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0))))) is different from false [2023-12-21 02:36:32,164 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2021 Int) (v_ArrVal_2023 Int) (v_ArrVal_2024 Int) (v_ArrVal_2026 (Array Int Int))) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_2021)))) (store .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_2023))))) (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_2024))))) (or (not (= (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_2026 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_2026)) (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_2026) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0))))) (= (mod |c_ULTIMATE.start_step_#t~mem6#1| 256) 0)) is different from false [2023-12-21 02:36:32,274 INFO L349 Elim1Store]: treesize reduction 126, result has 41.7 percent of original size [2023-12-21 02:36:32,275 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 146 treesize of output 119 [2023-12-21 02:36:32,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:36:32,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 163 [2023-12-21 02:36:32,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 85 [2023-12-21 02:36:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:36:33,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:33,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811003448] [2023-12-21 02:36:33,181 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:36:33,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411658757] [2023-12-21 02:36:33,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411658757] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:36:33,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 02:36:33,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2023-12-21 02:36:33,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871671493] [2023-12-21 02:36:33,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:33,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:36:33,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:33,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:36:33,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=101, Unknown=5, NotChecked=120, Total=272 [2023-12-21 02:36:33,183 INFO L87 Difference]: Start difference. First operand 221 states and 318 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:33,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:33,443 INFO L93 Difference]: Finished difference Result 479 states and 688 transitions. [2023-12-21 02:36:33,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:36:33,444 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2023-12-21 02:36:33,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:33,445 INFO L225 Difference]: With dead ends: 479 [2023-12-21 02:36:33,445 INFO L226 Difference]: Without dead ends: 259 [2023-12-21 02:36:33,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 254 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=165, Unknown=5, NotChecked=150, Total=380 [2023-12-21 02:36:33,446 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 154 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 977 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:33,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 248 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 977 Unchecked, 0.1s Time] [2023-12-21 02:36:33,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2023-12-21 02:36:33,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 218. [2023-12-21 02:36:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 199 states have (on average 1.4020100502512562) internal successors, (279), 199 states have internal predecessors, (279), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:36:33,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 313 transitions. [2023-12-21 02:36:33,463 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 313 transitions. Word has length 136 [2023-12-21 02:36:33,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:33,463 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 313 transitions. [2023-12-21 02:36:33,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 313 transitions. [2023-12-21 02:36:33,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-21 02:36:33,464 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:33,464 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:36:33,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-12-21 02:36:33,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:33,671 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:33,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:33,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1515617539, now seen corresponding path program 1 times [2023-12-21 02:36:33,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:33,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651426373] [2023-12-21 02:36:33,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:33,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:33,690 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:36:33,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2073983776] [2023-12-21 02:36:33,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:33,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:33,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:36:33,691 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:36:33,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-21 02:36:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:33,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 02:36:33,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:36:34,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:34,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-21 02:36:34,420 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:36:34,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:36:34,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2023-12-21 02:36:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:36:34,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:34,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651426373] [2023-12-21 02:36:34,669 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:36:34,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073983776] [2023-12-21 02:36:34,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073983776] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:36:34,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 02:36:34,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2023-12-21 02:36:34,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422901362] [2023-12-21 02:36:34,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:34,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 02:36:34,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:34,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 02:36:34,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-12-21 02:36:34,684 INFO L87 Difference]: Start difference. First operand 218 states and 313 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:35,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:35,004 INFO L93 Difference]: Finished difference Result 426 states and 612 transitions. [2023-12-21 02:36:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:36:35,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2023-12-21 02:36:35,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:35,005 INFO L225 Difference]: With dead ends: 426 [2023-12-21 02:36:35,005 INFO L226 Difference]: Without dead ends: 209 [2023-12-21 02:36:35,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2023-12-21 02:36:35,006 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 144 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:35,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 373 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 02:36:35,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-12-21 02:36:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 197. [2023-12-21 02:36:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 178 states have (on average 1.3876404494382022) internal successors, (247), 178 states have internal predecessors, (247), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:36:35,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 281 transitions. [2023-12-21 02:36:35,039 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 281 transitions. Word has length 136 [2023-12-21 02:36:35,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:35,039 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 281 transitions. [2023-12-21 02:36:35,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 281 transitions. [2023-12-21 02:36:35,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-21 02:36:35,040 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:35,040 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:36:35,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-12-21 02:36:35,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:35,266 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:35,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:35,267 INFO L85 PathProgramCache]: Analyzing trace with hash 647714122, now seen corresponding path program 1 times [2023-12-21 02:36:35,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:35,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767146192] [2023-12-21 02:36:35,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:35,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:35,304 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:36:35,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2058171135] [2023-12-21 02:36:35,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:35,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:35,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:36:35,305 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:36:35,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-12-21 02:36:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:35,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-21 02:36:35,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:36:38,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:38,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:38,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:38,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:38,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:38,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-21 02:36:38,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:38,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-21 02:36:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:36:38,217 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:36:38,234 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2243 (Array Int Int))) (or (not (= v_ArrVal_2243 (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_2243 c_~WrapperStruct00_var_1_16_Pointer~0.offset)))) (not (= (mod (select (select (store |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_2243) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)))) is different from false [2023-12-21 02:36:38,243 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2242 Int) (v_ArrVal_2243 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_2242)))) (or (not (= v_ArrVal_2243 (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_2243 c_~WrapperStruct00_var_1_16_Pointer~0.offset)))) (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_2243) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0))))) is different from false [2023-12-21 02:36:38,267 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2240 Int) (v_ArrVal_2242 Int) (v_ArrVal_2243 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_2240)))) (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_2242))))) (or (not (= v_ArrVal_2243 (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_2243 c_~WrapperStruct00_var_1_16_Pointer~0.offset)))) (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_2243) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0))))) is different from false [2023-12-21 02:36:38,284 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2240 Int) (v_ArrVal_2242 Int) (v_ArrVal_2243 (Array Int Int)) (v_ArrVal_2237 Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_2237)))) (store .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_2240))))) (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_2242))))) (or (not (= (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_2243 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_2243)) (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_2243) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0))))) is different from false [2023-12-21 02:36:38,327 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod |c_ULTIMATE.start_step_#t~mem6#1| 256) 0) (forall ((v_ArrVal_2240 Int) (v_ArrVal_2242 Int) (v_ArrVal_2243 (Array Int Int)) (v_ArrVal_2237 Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_2237)))) (store .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_2240))))) (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_2242))))) (or (not (= (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_2243 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_2243)) (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_2243) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)))))) is different from false [2023-12-21 02:36:38,440 INFO L349 Elim1Store]: treesize reduction 126, result has 41.7 percent of original size [2023-12-21 02:36:38,440 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 146 treesize of output 119 [2023-12-21 02:36:38,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:36:38,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 159 [2023-12-21 02:36:38,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2023-12-21 02:36:39,455 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:36:39,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:39,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767146192] [2023-12-21 02:36:39,456 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:36:39,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058171135] [2023-12-21 02:36:39,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058171135] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:36:39,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 02:36:39,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2023-12-21 02:36:39,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247203356] [2023-12-21 02:36:39,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:39,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:36:39,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:39,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:36:39,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=101, Unknown=5, NotChecked=120, Total=272 [2023-12-21 02:36:39,457 INFO L87 Difference]: Start difference. First operand 197 states and 281 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:39,812 INFO L93 Difference]: Finished difference Result 429 states and 611 transitions. [2023-12-21 02:36:39,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:36:39,812 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2023-12-21 02:36:39,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:39,813 INFO L225 Difference]: With dead ends: 429 [2023-12-21 02:36:39,813 INFO L226 Difference]: Without dead ends: 233 [2023-12-21 02:36:39,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 254 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=165, Unknown=5, NotChecked=150, Total=380 [2023-12-21 02:36:39,814 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 150 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 977 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:39,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 254 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 977 Unchecked, 0.1s Time] [2023-12-21 02:36:39,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-12-21 02:36:39,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 198. [2023-12-21 02:36:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 179 states have (on average 1.3910614525139664) internal successors, (249), 179 states have internal predecessors, (249), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:36:39,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 283 transitions. [2023-12-21 02:36:39,829 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 283 transitions. Word has length 136 [2023-12-21 02:36:39,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:39,830 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 283 transitions. [2023-12-21 02:36:39,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:39,830 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 283 transitions. [2023-12-21 02:36:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-21 02:36:39,830 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:39,831 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:36:39,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-12-21 02:36:40,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:40,038 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:40,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:40,039 INFO L85 PathProgramCache]: Analyzing trace with hash 60908108, now seen corresponding path program 1 times [2023-12-21 02:36:40,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:40,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055291232] [2023-12-21 02:36:40,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:40,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:40,057 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:36:40,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [436693841] [2023-12-21 02:36:40,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:40,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:40,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:36:40,058 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:36:40,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-21 02:36:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 02:36:40,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-21 02:36:40,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 02:36:42,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:42,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:42,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:42,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:42,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-12-21 02:36:42,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2023-12-21 02:36:42,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 02:36:42,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-21 02:36:42,846 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-21 02:36:42,846 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 02:36:42,860 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2354 (Array Int Int))) (or (not (= (mod (select (select (store |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_2354) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_2354 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_2354)))) is different from false [2023-12-21 02:36:42,867 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2352 Int) (v_ArrVal_2354 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_2352)))) (or (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_2354) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_2354 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_2354))))) is different from false [2023-12-21 02:36:42,888 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2351 Int) (v_ArrVal_2352 Int) (v_ArrVal_2354 (Array Int Int))) (let ((.cse0 (let ((.cse1 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_2351)))) (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_2352))))) (or (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_2354) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= v_ArrVal_2354 (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_2354 c_~WrapperStruct00_var_1_16_Pointer~0.offset))))))) is different from false [2023-12-21 02:36:42,933 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2351 Int) (v_ArrVal_2352 Int) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2349 Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_2349)))) (store .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_2351))))) (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_2352))))) (or (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_2354) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_2354 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_2354))))) is different from false [2023-12-21 02:36:43,004 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2351 Int) (v_ArrVal_2352 Int) (v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2349 Int)) (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_2349)))) (store .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_2351))))) (store .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_2352))))) (or (not (= (mod (select (select (store .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base v_ArrVal_2354) c_~WrapperStruct00_var_1_2_Pointer~0.base) c_~WrapperStruct00_var_1_2_Pointer~0.offset) 256) 0)) (not (= (store (select .cse0 c_~WrapperStruct00_var_1_16_Pointer~0.base) c_~WrapperStruct00_var_1_16_Pointer~0.offset (select v_ArrVal_2354 c_~WrapperStruct00_var_1_16_Pointer~0.offset)) v_ArrVal_2354))))) (= (mod |c_ULTIMATE.start_step_#t~mem6#1| 256) 0)) is different from false [2023-12-21 02:36:43,134 INFO L349 Elim1Store]: treesize reduction 126, result has 41.7 percent of original size [2023-12-21 02:36:43,135 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 146 treesize of output 119 [2023-12-21 02:36:43,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 02:36:43,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 159 [2023-12-21 02:36:43,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 71 [2023-12-21 02:36:44,102 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-21 02:36:44,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 02:36:44,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055291232] [2023-12-21 02:36:44,103 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 02:36:44,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436693841] [2023-12-21 02:36:44,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436693841] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 02:36:44,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 02:36:44,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2023-12-21 02:36:44,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901489357] [2023-12-21 02:36:44,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 02:36:44,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 02:36:44,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 02:36:44,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 02:36:44,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=101, Unknown=5, NotChecked=120, Total=272 [2023-12-21 02:36:44,104 INFO L87 Difference]: Start difference. First operand 198 states and 283 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:44,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 02:36:44,381 INFO L93 Difference]: Finished difference Result 430 states and 613 transitions. [2023-12-21 02:36:44,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 02:36:44,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2023-12-21 02:36:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 02:36:44,383 INFO L225 Difference]: With dead ends: 430 [2023-12-21 02:36:44,383 INFO L226 Difference]: Without dead ends: 233 [2023-12-21 02:36:44,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 254 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=165, Unknown=5, NotChecked=150, Total=380 [2023-12-21 02:36:44,385 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 152 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 977 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 02:36:44,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 252 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 977 Unchecked, 0.1s Time] [2023-12-21 02:36:44,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-12-21 02:36:44,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 190. [2023-12-21 02:36:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 171 states have (on average 1.3859649122807018) internal successors, (237), 171 states have internal predecessors, (237), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-12-21 02:36:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 271 transitions. [2023-12-21 02:36:44,400 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 271 transitions. Word has length 136 [2023-12-21 02:36:44,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 02:36:44,401 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 271 transitions. [2023-12-21 02:36:44,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2023-12-21 02:36:44,401 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 271 transitions. [2023-12-21 02:36:44,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-21 02:36:44,401 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 02:36:44,401 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 02:36:44,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-12-21 02:36:44,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:44,608 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 02:36:44,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 02:36:44,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1109630625, now seen corresponding path program 1 times [2023-12-21 02:36:44,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 02:36:44,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400448141] [2023-12-21 02:36:44,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:44,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 02:36:44,629 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 02:36:44,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [64408802] [2023-12-21 02:36:44,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 02:36:44,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:44,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 02:36:44,630 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 02:36:44,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-21 02:36:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:36:45,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 02:36:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 02:36:45,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 02:36:45,381 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 02:36:45,382 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 02:36:45,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-12-21 02:36:45,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 02:36:45,596 INFO L445 BasicCegarLoop]: Path program histogram: [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-21 02:36:45,598 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 02:36:45,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:36:45 BoogieIcfgContainer [2023-12-21 02:36:45,712 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 02:36:45,712 INFO L158 Benchmark]: Toolchain (without parser) took 101893.45ms. Allocated memory was 194.0MB in the beginning and 729.8MB in the end (delta: 535.8MB). Free memory was 152.0MB in the beginning and 266.0MB in the end (delta: -114.0MB). Peak memory consumption was 422.4MB. Max. memory is 8.0GB. [2023-12-21 02:36:45,712 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 02:36:45,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.14ms. Allocated memory is still 194.0MB. Free memory was 152.0MB in the beginning and 135.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-21 02:36:45,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.78ms. Allocated memory is still 194.0MB. Free memory was 135.4MB in the beginning and 130.9MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-21 02:36:45,713 INFO L158 Benchmark]: Boogie Preprocessor took 54.43ms. Allocated memory is still 194.0MB. Free memory was 130.9MB in the beginning and 126.0MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-21 02:36:45,713 INFO L158 Benchmark]: RCFGBuilder took 620.17ms. Allocated memory was 194.0MB in the beginning and 283.1MB in the end (delta: 89.1MB). Free memory was 126.0MB in the beginning and 234.9MB in the end (delta: -108.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2023-12-21 02:36:45,713 INFO L158 Benchmark]: TraceAbstraction took 100856.73ms. Allocated memory was 283.1MB in the beginning and 729.8MB in the end (delta: 446.7MB). Free memory was 234.3MB in the beginning and 266.0MB in the end (delta: -31.7MB). Peak memory consumption was 415.0MB. Max. memory is 8.0GB. [2023-12-21 02:36:45,714 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 146.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 300.14ms. Allocated memory is still 194.0MB. Free memory was 152.0MB in the beginning and 135.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.78ms. Allocated memory is still 194.0MB. Free memory was 135.4MB in the beginning and 130.9MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.43ms. Allocated memory is still 194.0MB. Free memory was 130.9MB in the beginning and 126.0MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 620.17ms. Allocated memory was 194.0MB in the beginning and 283.1MB in the end (delta: 89.1MB). Free memory was 126.0MB in the beginning and 234.9MB in the end (delta: -108.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 100856.73ms. Allocated memory was 283.1MB in the beginning and 729.8MB in the end (delta: 446.7MB). Free memory was 234.3MB in the beginning and 266.0MB in the end (delta: -31.7MB). Peak memory consumption was 415.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 134, overapproximation of bitwise operation at line 134, overapproximation of someUnaryFLOAToperation at line 134, overapproximation of someBinaryArithmeticFLOAToperation at line 98. Possible FailurePath: [L37] unsigned char isInitial = 0; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 64, 0, 8, -32, 128, 10, 2, 0, 32.5, 127.8, 999.25, 1000000000.5, 256.6 }; [L53] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L54] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L55] signed short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L56] signed short int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L57] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L58] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L59] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L60] signed long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L61] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L62] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L63] float* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L64] float* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L65] float* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L66] signed long int last_1_WrapperStruct00_var_1_10 = 0; [L138] isInitial = 1 [L139] FCALL initially() [L140] COND TRUE 1 [L141] CALL updateLastVariables() [L131] EXPR WrapperStruct00.var_1_10 [L131] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L141] RET updateLastVariables() [L142] CALL updateVariables() [L103] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L106] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L107] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -32768) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -32768) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L108] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L109] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_5 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_5 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L110] WrapperStruct00.var_1_6 = __VERIFIER_nondet_short() [L111] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -32768) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -32768) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L112] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L113] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_6 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_6 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L114] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L115] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L116] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L117] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L118] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L119] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L120] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L121] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L122] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L123] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L124] EXPR WrapperStruct00.var_1_13 [L124] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L124] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L124] EXPR WrapperStruct00.var_1_13 [L124] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L124] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L124] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L124] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L124] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L125] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L126] EXPR WrapperStruct00.var_1_14 [L126] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L126] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L126] EXPR WrapperStruct00.var_1_14 [L126] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L126] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L126] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L126] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L126] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L127] WrapperStruct00.var_1_15 = __VERIFIER_nondet_float() [L128] EXPR WrapperStruct00.var_1_15 [L128] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L128] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F [L128] EXPR WrapperStruct00.var_1_15 [L128] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L128] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L128] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L128] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L128] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L142] RET updateVariables() [L143] CALL step() [L70] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L70] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L70] signed long int stepLocal_0 = (last_1_WrapperStruct00_var_1_10 / (*(WrapperStruct00_var_1_5_Pointer))) % (*(WrapperStruct00_var_1_6_Pointer)); [L71] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L71] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L76] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L76] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_9_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L78] unsigned char stepLocal_2 = (*(WrapperStruct00_var_1_1_Pointer)); [L79] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L79] signed long int stepLocal_1 = (*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer)); [L80] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L80] COND FALSE !(stepLocal_1 < (*(WrapperStruct00_var_1_6_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L89] (*(WrapperStruct00_var_1_10_Pointer)) = (*(WrapperStruct00_var_1_9_Pointer)) [L91] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L91] unsigned char stepLocal_4 = (*(WrapperStruct00_var_1_1_Pointer)); [L92] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L92] EXPR ((*(WrapperStruct00_var_1_9_Pointer)) / (*(WrapperStruct00_var_1_5_Pointer))) << (*(WrapperStruct00_var_1_6_Pointer)) [L92] signed long int stepLocal_3 = ((*(WrapperStruct00_var_1_9_Pointer)) / (*(WrapperStruct00_var_1_5_Pointer))) << (*(WrapperStruct00_var_1_6_Pointer)); [L93] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L93] COND FALSE !(stepLocal_4 > (*(WrapperStruct00_var_1_10_Pointer))) [L98] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L98] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))) [L98] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L98] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0, stepLocal_0=0, stepLocal_1=6, stepLocal_2=3, stepLocal_3=2147483647, stepLocal_4=3] [L98] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L98] (*(WrapperStruct00_var_1_11_Pointer)) = ((((((*(WrapperStruct00_var_1_13_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - (*(WrapperStruct00_var_1_15_Pointer))) [L100] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L100] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_15_Pointer)) [L143] RET step() [L144] CALL, EXPR property() [L134] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L134] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / (*(WrapperStruct00_var_1_5_Pointer))) % (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) [L134] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L134] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / (*(WrapperStruct00_var_1_5_Pointer))) % (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L134] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / (*(WrapperStruct00_var_1_5_Pointer))) % (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))) < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_9_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L134] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / (*(WrapperStruct00_var_1_5_Pointer))) % (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))) < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_9_Pointer))))) [L134] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L134] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))) < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_9_Pointer)))) [L134] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L134] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))) < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_9_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L134] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / (*(WrapperStruct00_var_1_5_Pointer))) % (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))) < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_9_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L134] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / (*(WrapperStruct00_var_1_5_Pointer))) % (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))) < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_9_Pointer)))))) && (((*(WrapperStruct00_var_1_1_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) <= (((*(WrapperStruct00_var_1_9_Pointer)) / (*(WrapperStruct00_var_1_5_Pointer))) << (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) ((((((*(WrapperStruct00_var_1_13_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - (*(WrapperStruct00_var_1_15_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L134] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / (*(WrapperStruct00_var_1_5_Pointer))) % (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))) < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_9_Pointer)))))) && (((*(WrapperStruct00_var_1_1_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) <= (((*(WrapperStruct00_var_1_9_Pointer)) / (*(WrapperStruct00_var_1_5_Pointer))) << (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) ((((((*(WrapperStruct00_var_1_13_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - (*(WrapperStruct00_var_1_15_Pointer)))))) [L134] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L134] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) <= (((*(WrapperStruct00_var_1_9_Pointer)) / (*(WrapperStruct00_var_1_5_Pointer))) << (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) ((((((*(WrapperStruct00_var_1_13_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - (*(WrapperStruct00_var_1_15_Pointer))))) [L134] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L134] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))) [L134] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L134] EXPR (((*(WrapperStruct00_var_1_13_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L134] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L134] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) <= (((*(WrapperStruct00_var_1_9_Pointer)) / (*(WrapperStruct00_var_1_5_Pointer))) << (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) ((((((*(WrapperStruct00_var_1_13_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - (*(WrapperStruct00_var_1_15_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L134] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / (*(WrapperStruct00_var_1_5_Pointer))) % (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))) < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_9_Pointer)))))) && (((*(WrapperStruct00_var_1_1_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) <= (((*(WrapperStruct00_var_1_9_Pointer)) / (*(WrapperStruct00_var_1_5_Pointer))) << (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) ((((((*(WrapperStruct00_var_1_13_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - (*(WrapperStruct00_var_1_15_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L134] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / (*(WrapperStruct00_var_1_5_Pointer))) % (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))) < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_9_Pointer)))))) && (((*(WrapperStruct00_var_1_1_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) <= (((*(WrapperStruct00_var_1_9_Pointer)) / (*(WrapperStruct00_var_1_5_Pointer))) << (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) ((((((*(WrapperStruct00_var_1_13_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_15_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L134] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / (*(WrapperStruct00_var_1_5_Pointer))) % (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))) < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_9_Pointer)))))) && (((*(WrapperStruct00_var_1_1_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) <= (((*(WrapperStruct00_var_1_9_Pointer)) / (*(WrapperStruct00_var_1_5_Pointer))) << (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) ((((((*(WrapperStruct00_var_1_13_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_15_Pointer)))) [L134] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L134] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / (*(WrapperStruct00_var_1_5_Pointer))) % (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))) < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_9_Pointer)))))) && (((*(WrapperStruct00_var_1_1_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) <= (((*(WrapperStruct00_var_1_9_Pointer)) / (*(WrapperStruct00_var_1_5_Pointer))) << (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) ((((((*(WrapperStruct00_var_1_13_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_15_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L134-L135] return ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((last_1_WrapperStruct00_var_1_10 > ((last_1_WrapperStruct00_var_1_10 / (*(WrapperStruct00_var_1_5_Pointer))) % (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (((((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? ((((((*(WrapperStruct00_var_1_7_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_1_Pointer))) < (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_9_Pointer)))))) && (((*(WrapperStruct00_var_1_1_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) <= (((*(WrapperStruct00_var_1_9_Pointer)) / (*(WrapperStruct00_var_1_5_Pointer))) << (*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) ((((((*(WrapperStruct00_var_1_13_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) - (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((float) (*(WrapperStruct00_var_1_15_Pointer)))) ; [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_10=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:9}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_13_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:21}, WrapperStruct00_var_1_15_Pointer={4:25}, WrapperStruct00_var_1_16_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:7}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_10=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 100.7s, OverallIterations: 23, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 26 mSolverCounterUnknown, 4509 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4509 mSDsluCounter, 8970 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8598 IncrementalHoareTripleChecker+Unchecked, 5862 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5115 IncrementalHoareTripleChecker+Invalid, 13858 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 3108 mSDtfsCounter, 5115 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4894 GetRequests, 4552 SyntacticMatches, 35 SemanticMatches, 307 ConstructedPredicates, 42 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=14, InterpolantAutomatonStates: 151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 848 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 71.1s InterpolantComputationTime, 3211 NumberOfCodeBlocks, 3211 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 4794 ConstructedInterpolants, 138 QuantifiedInterpolants, 105694 SizeOfPredicates, 329 NumberOfNonLiveVariables, 10758 ConjunctsInSsa, 733 ConjunctsInUnsatCore, 36 InterpolantComputations, 22 PerfectInterpolantSequences, 18912/19584 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-21 02:36:45,944 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-21 02:36:45,973 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 137 Received shutdown request...