/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-92.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:30:33,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:30:33,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 04:30:33,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:30:33,477 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:30:33,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:30:33,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:30:33,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:30:33,602 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:30:33,605 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:30:33,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:30:33,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:30:33,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:30:33,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:30:33,607 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:30:33,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:30:33,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:30:33,607 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:30:33,607 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:30:33,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:30:33,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:30:33,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:30:33,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:30:33,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:30:33,609 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:30:33,609 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:30:33,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:30:33,609 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:30:33,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:30:33,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:30:33,610 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:30:33,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:30:33,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:30:33,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:30:33,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:30:33,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:30:33,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:30:33,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:30:33,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:30:33,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:30:33,611 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:30:33,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:30:33,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:30:33,612 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 04:30:33,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:30:33,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:30:33,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:30:33,971 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:30:33,973 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:30:33,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-92.i [2023-12-16 04:30:35,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:30:35,346 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:30:35,347 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-92.i [2023-12-16 04:30:35,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eff1f22e1/042a86c134034abf920d51a1ce016dbc/FLAGc5e0d8d8d [2023-12-16 04:30:35,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eff1f22e1/042a86c134034abf920d51a1ce016dbc [2023-12-16 04:30:35,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:30:35,376 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:30:35,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:30:35,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:30:35,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:30:35,383 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:30:35" (1/1) ... [2023-12-16 04:30:35,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66287cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:35, skipping insertion in model container [2023-12-16 04:30:35,384 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:30:35" (1/1) ... [2023-12-16 04:30:35,412 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:30:35,533 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-92.i[916,929] [2023-12-16 04:30:35,584 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:30:35,592 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:30:35,607 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-92.i[916,929] [2023-12-16 04:30:35,629 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:30:35,643 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:30:35,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:35 WrapperNode [2023-12-16 04:30:35,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:30:35,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:30:35,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:30:35,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:30:35,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:35" (1/1) ... [2023-12-16 04:30:35,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:35" (1/1) ... [2023-12-16 04:30:35,707 INFO L138 Inliner]: procedures = 29, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 435 [2023-12-16 04:30:35,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:30:35,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:30:35,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:30:35,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:30:35,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:35" (1/1) ... [2023-12-16 04:30:35,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:35" (1/1) ... [2023-12-16 04:30:35,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:35" (1/1) ... [2023-12-16 04:30:35,736 INFO L175 MemorySlicer]: Split 123 memory accesses to 2 slices as follows [2, 121]. 98 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 18 writes are split as follows [0, 18]. [2023-12-16 04:30:35,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:35" (1/1) ... [2023-12-16 04:30:35,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:35" (1/1) ... [2023-12-16 04:30:35,750 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:35" (1/1) ... [2023-12-16 04:30:35,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:35" (1/1) ... [2023-12-16 04:30:35,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:35" (1/1) ... [2023-12-16 04:30:35,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:35" (1/1) ... [2023-12-16 04:30:35,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:30:35,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:30:35,776 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:30:35,776 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:30:35,777 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:35" (1/1) ... [2023-12-16 04:30:35,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:30:35,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:35,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 04:30:35,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 04:30:35,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:30:35,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:30:35,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:30:35,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:30:35,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:30:35,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:30:35,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:30:35,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:30:35,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:30:35,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:30:35,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:30:35,866 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:30:35,866 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:30:35,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:30:35,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:30:35,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:30:35,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:30:35,937 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:30:35,938 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:30:36,324 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:30:36,360 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:30:36,361 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:30:36,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:30:36 BoogieIcfgContainer [2023-12-16 04:30:36,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:30:36,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:30:36,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:30:36,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:30:36,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:30:35" (1/3) ... [2023-12-16 04:30:36,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2184b2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:30:36, skipping insertion in model container [2023-12-16 04:30:36,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:30:35" (2/3) ... [2023-12-16 04:30:36,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2184b2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:30:36, skipping insertion in model container [2023-12-16 04:30:36,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:30:36" (3/3) ... [2023-12-16 04:30:36,376 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-92.i [2023-12-16 04:30:36,388 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:30:36,388 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:30:36,428 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:30:36,434 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;@49ef32d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:30:36,435 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:30:36,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-16 04:30:36,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 04:30:36,453 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:36,454 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:36,454 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:36,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:36,458 INFO L85 PathProgramCache]: Analyzing trace with hash 983717976, now seen corresponding path program 1 times [2023-12-16 04:30:36,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:36,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239374561] [2023-12-16 04:30:36,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:36,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:36,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:36,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239374561] [2023-12-16 04:30:36,831 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-16 04:30:36,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142991020] [2023-12-16 04:30:36,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:36,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:36,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:36,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:30:36,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 04:30:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:37,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 04:30:37,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:30:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2023-12-16 04:30:37,056 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:30:37,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142991020] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:37,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:37,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:30:37,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434685358] [2023-12-16 04:30:37,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:37,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:30:37,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:37,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:30:37,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:30:37,081 INFO L87 Difference]: Start difference. First operand has 98 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-16 04:30:37,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:37,110 INFO L93 Difference]: Finished difference Result 193 states and 305 transitions. [2023-12-16 04:30:37,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:30:37,111 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 146 [2023-12-16 04:30:37,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:37,116 INFO L225 Difference]: With dead ends: 193 [2023-12-16 04:30:37,116 INFO L226 Difference]: Without dead ends: 96 [2023-12-16 04:30:37,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:30:37,121 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:37,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:30:37,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-16 04:30:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-12-16 04:30:37,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-16 04:30:37,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 139 transitions. [2023-12-16 04:30:37,153 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 139 transitions. Word has length 146 [2023-12-16 04:30:37,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:37,154 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 139 transitions. [2023-12-16 04:30:37,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-16 04:30:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 139 transitions. [2023-12-16 04:30:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 04:30:37,158 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:37,158 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:37,178 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-16 04:30:37,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-16 04:30:37,367 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:37,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:37,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1642185142, now seen corresponding path program 1 times [2023-12-16 04:30:37,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:37,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103660304] [2023-12-16 04:30:37,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:37,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:37,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:37,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103660304] [2023-12-16 04:30:37,514 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-16 04:30:37,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129172532] [2023-12-16 04:30:37,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:37,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:37,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:37,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:30:37,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 04:30:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:37,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 04:30:37,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:30:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2023-12-16 04:30:37,750 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:30:37,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129172532] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:37,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:37,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:30:37,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033683433] [2023-12-16 04:30:37,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:37,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:30:37,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:37,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:30:37,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:30:37,774 INFO L87 Difference]: Start difference. First operand 96 states and 139 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-16 04:30:37,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:37,830 INFO L93 Difference]: Finished difference Result 197 states and 286 transitions. [2023-12-16 04:30:37,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:30:37,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 146 [2023-12-16 04:30:37,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:37,832 INFO L225 Difference]: With dead ends: 197 [2023-12-16 04:30:37,832 INFO L226 Difference]: Without dead ends: 102 [2023-12-16 04:30:37,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:30:37,834 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 10 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:37,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 394 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:30:37,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-16 04:30:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2023-12-16 04:30:37,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-16 04:30:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2023-12-16 04:30:37,845 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 146 [2023-12-16 04:30:37,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:37,845 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2023-12-16 04:30:37,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-16 04:30:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2023-12-16 04:30:37,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 04:30:37,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:37,848 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:37,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-16 04:30:38,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-16 04:30:38,060 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:38,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:38,060 INFO L85 PathProgramCache]: Analyzing trace with hash -773651208, now seen corresponding path program 1 times [2023-12-16 04:30:38,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:38,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552358502] [2023-12-16 04:30:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:38,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:38,097 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:30:38,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1074628282] [2023-12-16 04:30:38,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:38,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:38,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:38,100 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:30:38,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 04:30:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:38,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 04:30:38,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:30:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-16 04:30:38,287 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:30:38,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:38,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552358502] [2023-12-16 04:30:38,288 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:30:38,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074628282] [2023-12-16 04:30:38,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074628282] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:38,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:38,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:30:38,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050369361] [2023-12-16 04:30:38,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:38,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:30:38,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:38,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:30:38,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:30:38,290 INFO L87 Difference]: Start difference. First operand 98 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-16 04:30:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:38,338 INFO L93 Difference]: Finished difference Result 199 states and 286 transitions. [2023-12-16 04:30:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:30:38,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2023-12-16 04:30:38,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:38,343 INFO L225 Difference]: With dead ends: 199 [2023-12-16 04:30:38,343 INFO L226 Difference]: Without dead ends: 102 [2023-12-16 04:30:38,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:30:38,347 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 3 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:38,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 393 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:30:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-16 04:30:38,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2023-12-16 04:30:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-16 04:30:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2023-12-16 04:30:38,361 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 146 [2023-12-16 04:30:38,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:38,361 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2023-12-16 04:30:38,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-16 04:30:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2023-12-16 04:30:38,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 04:30:38,363 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:38,363 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:38,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 04:30:38,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:38,575 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:38,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:38,575 INFO L85 PathProgramCache]: Analyzing trace with hash -773591626, now seen corresponding path program 1 times [2023-12-16 04:30:38,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:38,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41876268] [2023-12-16 04:30:38,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:38,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:38,652 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:30:38,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [879523888] [2023-12-16 04:30:38,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:38,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:38,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:38,672 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:30:38,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 04:30:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:39,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-16 04:30:39,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:30:39,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:39,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 10 [2023-12-16 04:30:39,139 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 23 treesize of output 11 [2023-12-16 04:30:39,176 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 23 treesize of output 11 [2023-12-16 04:30:39,210 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 23 treesize of output 11 [2023-12-16 04:30:39,266 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 23 treesize of output 11 [2023-12-16 04:30:39,303 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 23 treesize of output 11 [2023-12-16 04:30:39,329 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 23 treesize of output 11 [2023-12-16 04:30:39,357 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 23 treesize of output 11 [2023-12-16 04:30:39,407 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 23 treesize of output 11 [2023-12-16 04:30:39,440 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 23 treesize of output 11 [2023-12-16 04:30:39,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 61 [2023-12-16 04:30:39,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 81 [2023-12-16 04:30:39,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 43 [2023-12-16 04:30:39,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:39,917 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 1 case distinctions, treesize of input 65 treesize of output 40 [2023-12-16 04:30:39,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:39,935 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 1 case distinctions, treesize of input 57 treesize of output 29 [2023-12-16 04:30:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 18 proven. 54 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:30:39,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:30:40,497 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2023-12-16 04:30:40,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:40,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41876268] [2023-12-16 04:30:40,498 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:30:40,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879523888] [2023-12-16 04:30:40,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879523888] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:30:40,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:30:40,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2023-12-16 04:30:40,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714874306] [2023-12-16 04:30:40,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:30:40,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 04:30:40,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:40,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 04:30:40,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:30:40,500 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 13 states, 11 states have (on average 8.545454545454545) internal successors, (94), 13 states have internal predecessors, (94), 4 states have call successors, (38), 3 states have call predecessors, (38), 4 states have return successors, (38), 2 states have call predecessors, (38), 4 states have call successors, (38) [2023-12-16 04:30:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:40,870 INFO L93 Difference]: Finished difference Result 205 states and 290 transitions. [2023-12-16 04:30:40,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 04:30:40,871 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.545454545454545) internal successors, (94), 13 states have internal predecessors, (94), 4 states have call successors, (38), 3 states have call predecessors, (38), 4 states have return successors, (38), 2 states have call predecessors, (38), 4 states have call successors, (38) Word has length 146 [2023-12-16 04:30:40,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:40,872 INFO L225 Difference]: With dead ends: 205 [2023-12-16 04:30:40,872 INFO L226 Difference]: Without dead ends: 106 [2023-12-16 04:30:40,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2023-12-16 04:30:40,873 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 304 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:40,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 244 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:30:40,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-16 04:30:40,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2023-12-16 04:30:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.3048780487804879) internal successors, (107), 82 states have internal predecessors, (107), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-16 04:30:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 145 transitions. [2023-12-16 04:30:40,880 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 145 transitions. Word has length 146 [2023-12-16 04:30:40,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:40,881 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 145 transitions. [2023-12-16 04:30:40,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.545454545454545) internal successors, (94), 13 states have internal predecessors, (94), 4 states have call successors, (38), 3 states have call predecessors, (38), 4 states have return successors, (38), 2 states have call predecessors, (38), 4 states have call successors, (38) [2023-12-16 04:30:40,881 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 145 transitions. [2023-12-16 04:30:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 04:30:40,882 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:40,883 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:40,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-16 04:30:41,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:41,089 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:41,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:41,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1591240076, now seen corresponding path program 1 times [2023-12-16 04:30:41,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:41,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706396754] [2023-12-16 04:30:41,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:41,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:41,120 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:30:41,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1122262052] [2023-12-16 04:30:41,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:41,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:41,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:41,146 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:30:41,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 04:30:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:41,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 90 conjunts are in the unsatisfiable core [2023-12-16 04:30:41,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:30:41,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:41,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 50 treesize of output 22 [2023-12-16 04:30:41,639 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 30 treesize of output 14 [2023-12-16 04:30:41,843 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 44 treesize of output 27 [2023-12-16 04:30:41,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:41,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 42 [2023-12-16 04:30:42,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:42,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 42 [2023-12-16 04:30:42,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:42,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 42 [2023-12-16 04:30:42,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:42,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 42 [2023-12-16 04:30:42,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:42,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 42 [2023-12-16 04:30:43,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:43,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 42 [2023-12-16 04:30:43,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:43,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 42 [2023-12-16 04:30:43,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 112 [2023-12-16 04:30:43,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 118 [2023-12-16 04:30:43,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 77 [2023-12-16 04:30:43,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:43,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 205 treesize of output 114 [2023-12-16 04:30:43,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:43,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 205 treesize of output 114 [2023-12-16 04:30:43,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 172 [2023-12-16 04:30:43,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 178 [2023-12-16 04:30:43,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 136 [2023-12-16 04:30:44,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:44,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 430 treesize of output 233 [2023-12-16 04:30:45,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:45,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 443 treesize of output 203 [2023-12-16 04:30:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 84 proven. 180 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-16 04:30:45,225 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:30:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-16 04:30:45,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:45,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706396754] [2023-12-16 04:30:45,637 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:30:45,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122262052] [2023-12-16 04:30:45,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122262052] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 04:30:45,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 04:30:45,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [26] total 32 [2023-12-16 04:30:45,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633300977] [2023-12-16 04:30:45,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:45,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:30:45,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:45,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:30:45,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=832, Unknown=0, NotChecked=0, Total=992 [2023-12-16 04:30:45,639 INFO L87 Difference]: Start difference. First operand 104 states and 145 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-16 04:30:46,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:46,573 INFO L93 Difference]: Finished difference Result 276 states and 386 transitions. [2023-12-16 04:30:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:30:46,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2023-12-16 04:30:46,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:46,575 INFO L225 Difference]: With dead ends: 276 [2023-12-16 04:30:46,575 INFO L226 Difference]: Without dead ends: 173 [2023-12-16 04:30:46,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=191, Invalid=1141, Unknown=0, NotChecked=0, Total=1332 [2023-12-16 04:30:46,576 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 133 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:46,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 665 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 04:30:46,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-12-16 04:30:46,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 120. [2023-12-16 04:30:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 98 states have (on average 1.316326530612245) internal successors, (129), 98 states have internal predecessors, (129), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-16 04:30:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 167 transitions. [2023-12-16 04:30:46,584 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 167 transitions. Word has length 146 [2023-12-16 04:30:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:46,584 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 167 transitions. [2023-12-16 04:30:46,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-16 04:30:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 167 transitions. [2023-12-16 04:30:46,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 04:30:46,585 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:46,585 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:46,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-16 04:30:46,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:46,796 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:46,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:46,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1692609970, now seen corresponding path program 1 times [2023-12-16 04:30:46,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:46,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668491231] [2023-12-16 04:30:46,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:46,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:46,849 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:30:46,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1126122026] [2023-12-16 04:30:46,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:46,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:46,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:46,858 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:30:46,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-16 04:30:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:47,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 04:30:47,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:30:47,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:47,074 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 28 treesize of output 10 [2023-12-16 04:30:47,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 74 [2023-12-16 04:30:47,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:47,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 116 [2023-12-16 04:30:47,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 74 [2023-12-16 04:30:47,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:47,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 103 treesize of output 66 [2023-12-16 04:30:47,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:47,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 103 treesize of output 66 [2023-12-16 04:30:47,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 106 [2023-12-16 04:30:47,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:47,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 148 [2023-12-16 04:30:47,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:47,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 91 treesize of output 93 [2023-12-16 04:30:47,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:47,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 230 treesize of output 135 [2023-12-16 04:30:47,745 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:47,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 238 treesize of output 92 [2023-12-16 04:30:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-16 04:30:47,760 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:30:47,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:47,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668491231] [2023-12-16 04:30:47,760 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:30:47,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126122026] [2023-12-16 04:30:47,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126122026] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:47,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:47,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:30:47,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251422985] [2023-12-16 04:30:47,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:47,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:30:47,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:47,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:30:47,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:30:47,762 INFO L87 Difference]: Start difference. First operand 120 states and 167 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-16 04:30:48,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:48,177 INFO L93 Difference]: Finished difference Result 360 states and 492 transitions. [2023-12-16 04:30:48,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:30:48,178 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2023-12-16 04:30:48,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:48,179 INFO L225 Difference]: With dead ends: 360 [2023-12-16 04:30:48,179 INFO L226 Difference]: Without dead ends: 241 [2023-12-16 04:30:48,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:30:48,180 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 155 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:48,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 632 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:30:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-12-16 04:30:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 161. [2023-12-16 04:30:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 133 states have (on average 1.3082706766917294) internal successors, (174), 134 states have internal predecessors, (174), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-16 04:30:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 220 transitions. [2023-12-16 04:30:48,190 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 220 transitions. Word has length 146 [2023-12-16 04:30:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:48,191 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 220 transitions. [2023-12-16 04:30:48,191 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-16 04:30:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 220 transitions. [2023-12-16 04:30:48,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 04:30:48,192 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:48,192 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:48,219 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-16 04:30:48,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:48,393 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:48,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:48,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1725253582, now seen corresponding path program 1 times [2023-12-16 04:30:48,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:48,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956647750] [2023-12-16 04:30:48,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:48,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:48,415 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:30:48,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1834692908] [2023-12-16 04:30:48,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:48,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:48,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:48,417 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-16 04:30:48,419 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-16 04:30:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:48,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 04:30:48,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:30:48,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 73 [2023-12-16 04:30:48,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:48,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 115 [2023-12-16 04:30:49,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:49,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 92 treesize of output 54 [2023-12-16 04:30:49,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 72 [2023-12-16 04:30:49,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:49,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 101 treesize of output 64 [2023-12-16 04:30:49,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:49,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 101 treesize of output 64 [2023-12-16 04:30:49,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 104 [2023-12-16 04:30:49,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:49,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 146 [2023-12-16 04:30:49,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 91 [2023-12-16 04:30:49,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:49,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 226 treesize of output 131 [2023-12-16 04:30:49,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:49,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 234 treesize of output 88 [2023-12-16 04:30:49,405 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-16 04:30:49,405 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:30:49,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:49,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956647750] [2023-12-16 04:30:49,405 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:30:49,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834692908] [2023-12-16 04:30:49,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834692908] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:49,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:49,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:30:49,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108676113] [2023-12-16 04:30:49,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:49,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:30:49,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:49,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:30:49,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:30:49,407 INFO L87 Difference]: Start difference. First operand 161 states and 220 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-16 04:30:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:49,794 INFO L93 Difference]: Finished difference Result 380 states and 512 transitions. [2023-12-16 04:30:49,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:30:49,794 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2023-12-16 04:30:49,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:49,795 INFO L225 Difference]: With dead ends: 380 [2023-12-16 04:30:49,795 INFO L226 Difference]: Without dead ends: 220 [2023-12-16 04:30:49,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:30:49,796 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 229 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:49,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 526 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:30:49,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-12-16 04:30:49,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 124. [2023-12-16 04:30:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-16 04:30:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 168 transitions. [2023-12-16 04:30:49,804 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 168 transitions. Word has length 146 [2023-12-16 04:30:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:49,804 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 168 transitions. [2023-12-16 04:30:49,804 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-16 04:30:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 168 transitions. [2023-12-16 04:30:49,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 04:30:49,805 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:49,805 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:49,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-16 04:30:50,005 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-16 04:30:50,006 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:50,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:50,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1558596464, now seen corresponding path program 1 times [2023-12-16 04:30:50,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:50,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718550793] [2023-12-16 04:30:50,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:50,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:50,061 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:30:50,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1136638089] [2023-12-16 04:30:50,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:50,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:50,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:50,063 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-16 04:30:50,073 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-16 04:30:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:50,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-16 04:30:50,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:30:50,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:50,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 43 treesize of output 19 [2023-12-16 04:30:51,055 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 30 treesize of output 14 [2023-12-16 04:30:51,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:51,293 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 1 case distinctions, treesize of input 44 treesize of output 27 [2023-12-16 04:30:51,369 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 44 treesize of output 27 [2023-12-16 04:30:51,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 40 [2023-12-16 04:30:52,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:52,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 53 [2023-12-16 04:30:52,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:52,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 53 [2023-12-16 04:30:52,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:52,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 53 [2023-12-16 04:30:53,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:53,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 53 [2023-12-16 04:30:53,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:53,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 53 [2023-12-16 04:30:53,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 140 [2023-12-16 04:30:53,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 144 [2023-12-16 04:30:53,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 88 [2023-12-16 04:30:53,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:53,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 257 treesize of output 141 [2023-12-16 04:30:54,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:54,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 257 treesize of output 141 [2023-12-16 04:30:54,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 292 treesize of output 208 [2023-12-16 04:30:54,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 208 [2023-12-16 04:30:54,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 163 [2023-12-16 04:30:54,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:54,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 534 treesize of output 280 [2023-12-16 04:30:55,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:55,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 553 treesize of output 245 [2023-12-16 04:30:56,057 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 294 proven. 240 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-16 04:30:56,058 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:30:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-16 04:30:56,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:56,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718550793] [2023-12-16 04:30:56,529 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:30:56,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136638089] [2023-12-16 04:30:56,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136638089] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 04:30:56,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 04:30:56,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [42] total 48 [2023-12-16 04:30:56,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702786424] [2023-12-16 04:30:56,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:56,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:30:56,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:56,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:30:56,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=1886, Unknown=0, NotChecked=0, Total=2256 [2023-12-16 04:30:56,531 INFO L87 Difference]: Start difference. First operand 124 states and 168 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-16 04:30:57,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:57,060 INFO L93 Difference]: Finished difference Result 275 states and 373 transitions. [2023-12-16 04:30:57,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:30:57,061 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 146 [2023-12-16 04:30:57,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:57,061 INFO L225 Difference]: With dead ends: 275 [2023-12-16 04:30:57,061 INFO L226 Difference]: Without dead ends: 152 [2023-12-16 04:30:57,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=394, Invalid=2258, Unknown=0, NotChecked=0, Total=2652 [2023-12-16 04:30:57,063 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 114 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:57,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 788 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 04:30:57,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-12-16 04:30:57,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 122. [2023-12-16 04:30:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.2828282828282829) internal successors, (127), 99 states have internal predecessors, (127), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-16 04:30:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 165 transitions. [2023-12-16 04:30:57,073 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 165 transitions. Word has length 146 [2023-12-16 04:30:57,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:57,074 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 165 transitions. [2023-12-16 04:30:57,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-16 04:30:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 165 transitions. [2023-12-16 04:30:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-16 04:30:57,075 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:57,075 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:57,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-16 04:30:57,283 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-16 04:30:57,284 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:57,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:57,284 INFO L85 PathProgramCache]: Analyzing trace with hash -778751943, now seen corresponding path program 1 times [2023-12-16 04:30:57,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:57,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488204981] [2023-12-16 04:30:57,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:57,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:57,313 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:30:57,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1660476105] [2023-12-16 04:30:57,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:57,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:30:57,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:30:57,314 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-16 04:30:57,339 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-16 04:30:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:57,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 41 conjunts are in the unsatisfiable core [2023-12-16 04:30:57,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:30:57,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:57,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 46 treesize of output 16 [2023-12-16 04:30:57,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-16 04:30:57,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-16 04:30:57,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-16 04:30:57,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:57,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2023-12-16 04:30:57,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:57,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 28 [2023-12-16 04:30:58,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 73 [2023-12-16 04:30:58,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:58,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 105 [2023-12-16 04:30:58,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2023-12-16 04:30:58,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:58,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 97 treesize of output 63 [2023-12-16 04:30:58,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:30:58,515 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 183 treesize of output 83 [2023-12-16 04:30:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 456 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2023-12-16 04:30:58,634 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:31:00,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:00,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488204981] [2023-12-16 04:31:00,028 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:31:00,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660476105] [2023-12-16 04:31:00,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660476105] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 04:31:00,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-16 04:31:00,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2023-12-16 04:31:00,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498004798] [2023-12-16 04:31:00,030 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-16 04:31:00,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 04:31:00,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:00,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 04:31:00,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-12-16 04:31:00,031 INFO L87 Difference]: Start difference. First operand 122 states and 165 transitions. Second operand has 12 states, 10 states have (on average 6.8) internal successors, (68), 12 states have internal predecessors, (68), 5 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2023-12-16 04:31:00,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:00,690 INFO L93 Difference]: Finished difference Result 259 states and 342 transitions. [2023-12-16 04:31:00,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 04:31:00,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.8) internal successors, (68), 12 states have internal predecessors, (68), 5 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) Word has length 148 [2023-12-16 04:31:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:00,691 INFO L225 Difference]: With dead ends: 259 [2023-12-16 04:31:00,691 INFO L226 Difference]: Without dead ends: 138 [2023-12-16 04:31:00,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2023-12-16 04:31:00,692 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 143 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:00,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 317 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 04:31:00,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-16 04:31:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 134. [2023-12-16 04:31:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 108 states have (on average 1.2407407407407407) internal successors, (134), 108 states have internal predecessors, (134), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-16 04:31:00,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2023-12-16 04:31:00,700 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 148 [2023-12-16 04:31:00,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:00,701 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2023-12-16 04:31:00,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.8) internal successors, (68), 12 states have internal predecessors, (68), 5 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2023-12-16 04:31:00,701 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2023-12-16 04:31:00,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-16 04:31:00,702 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:00,702 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:00,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-16 04:31:00,911 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-16 04:31:00,911 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:00,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:00,911 INFO L85 PathProgramCache]: Analyzing trace with hash -430271693, now seen corresponding path program 1 times [2023-12-16 04:31:00,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:00,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103799334] [2023-12-16 04:31:00,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:00,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:00,952 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:31:00,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2105314237] [2023-12-16 04:31:00,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:00,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:31:00,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:31:00,966 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-16 04:31:00,980 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-16 04:31:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:01,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-16 04:31:01,217 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:31:01,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2023-12-16 04:31:01,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 74 [2023-12-16 04:31:01,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:31:01,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 106 [2023-12-16 04:31:01,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 43 treesize of output 30 [2023-12-16 04:31:01,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:31:01,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 99 treesize of output 65 [2023-12-16 04:31:01,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:31:01,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 99 treesize of output 65 [2023-12-16 04:31:01,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:31:01,828 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 109 treesize of output 57 [2023-12-16 04:31:01,839 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 184 proven. 3 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2023-12-16 04:31:01,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:31:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 99 proven. 3 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2023-12-16 04:31:02,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:02,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103799334] [2023-12-16 04:31:02,346 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:31:02,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105314237] [2023-12-16 04:31:02,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105314237] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:31:02,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:31:02,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2023-12-16 04:31:02,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996126422] [2023-12-16 04:31:02,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:31:02,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-16 04:31:02,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:02,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-16 04:31:02,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-12-16 04:31:02,348 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand has 17 states, 13 states have (on average 6.230769230769231) internal successors, (81), 17 states have internal predecessors, (81), 7 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 7 states have call successors, (22) [2023-12-16 04:31:02,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:02,991 INFO L93 Difference]: Finished difference Result 277 states and 352 transitions. [2023-12-16 04:31:02,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 04:31:02,995 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 6.230769230769231) internal successors, (81), 17 states have internal predecessors, (81), 7 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 7 states have call successors, (22) Word has length 150 [2023-12-16 04:31:02,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:02,996 INFO L225 Difference]: With dead ends: 277 [2023-12-16 04:31:02,996 INFO L226 Difference]: Without dead ends: 144 [2023-12-16 04:31:02,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 278 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2023-12-16 04:31:02,997 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 385 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:02,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 295 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 04:31:02,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-12-16 04:31:03,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2023-12-16 04:31:03,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 111 states have (on average 1.2162162162162162) internal successors, (135), 111 states have internal predecessors, (135), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-16 04:31:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 173 transitions. [2023-12-16 04:31:03,007 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 173 transitions. Word has length 150 [2023-12-16 04:31:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:03,007 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 173 transitions. [2023-12-16 04:31:03,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 6.230769230769231) internal successors, (81), 17 states have internal predecessors, (81), 7 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 7 states have call successors, (22) [2023-12-16 04:31:03,008 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 173 transitions. [2023-12-16 04:31:03,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-16 04:31:03,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:03,008 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:03,015 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-16 04:31:03,209 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-16 04:31:03,209 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:03,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:03,209 INFO L85 PathProgramCache]: Analyzing trace with hash -7569867, now seen corresponding path program 1 times [2023-12-16 04:31:03,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:03,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670338421] [2023-12-16 04:31:03,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:03,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:03,262 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:31:03,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [33083511] [2023-12-16 04:31:03,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:03,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:31:03,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:31:03,263 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-16 04:31:03,289 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-16 04:31:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:31:03,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 04:31:03,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:31:03,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-16 04:31:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2023-12-16 04:31:03,550 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:31:03,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:31:03,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670338421] [2023-12-16 04:31:03,550 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:31:03,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33083511] [2023-12-16 04:31:03,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33083511] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:31:03,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:31:03,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:31:03,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743018499] [2023-12-16 04:31:03,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:31:03,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:31:03,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:31:03,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:31:03,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:31:03,552 INFO L87 Difference]: Start difference. First operand 138 states and 173 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-16 04:31:03,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:31:03,663 INFO L93 Difference]: Finished difference Result 275 states and 345 transitions. [2023-12-16 04:31:03,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:31:03,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2023-12-16 04:31:03,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:31:03,665 INFO L225 Difference]: With dead ends: 275 [2023-12-16 04:31:03,665 INFO L226 Difference]: Without dead ends: 138 [2023-12-16 04:31:03,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:31:03,667 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 116 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:31:03,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 224 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:31:03,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-12-16 04:31:03,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2023-12-16 04:31:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 111 states have (on average 1.1981981981981982) internal successors, (133), 111 states have internal predecessors, (133), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-16 04:31:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 171 transitions. [2023-12-16 04:31:03,680 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 171 transitions. Word has length 150 [2023-12-16 04:31:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:31:03,680 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 171 transitions. [2023-12-16 04:31:03,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2023-12-16 04:31:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 171 transitions. [2023-12-16 04:31:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-16 04:31:03,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:31:03,685 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:03,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-16 04:31:03,892 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-16 04:31:03,893 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:31:03,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:31:03,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2126228454, now seen corresponding path program 1 times [2023-12-16 04:31:03,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:31:03,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74479169] [2023-12-16 04:31:03,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:03,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:31:03,929 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:31:03,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [147344445] [2023-12-16 04:31:03,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:31:03,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:31:03,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:31:03,941 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-16 04:31:03,984 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-16 04:31:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:31:04,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:31:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:31:04,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:31:04,972 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:31:04,972 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:31:05,000 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-16 04:31:05,184 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-16 04:31:05,187 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:31:05,189 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:31:05,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:31:05 BoogieIcfgContainer [2023-12-16 04:31:05,297 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:31:05,300 INFO L158 Benchmark]: Toolchain (without parser) took 29921.05ms. Allocated memory was 218.1MB in the beginning and 672.1MB in the end (delta: 454.0MB). Free memory was 164.3MB in the beginning and 303.6MB in the end (delta: -139.3MB). Peak memory consumption was 315.7MB. Max. memory is 8.0GB. [2023-12-16 04:31:05,302 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory was 127.6MB in the beginning and 127.6MB in the end (delta: 86.5kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:31:05,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.53ms. Allocated memory is still 218.1MB. Free memory was 163.9MB in the beginning and 147.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 04:31:05,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.01ms. Allocated memory is still 218.1MB. Free memory was 147.6MB in the beginning and 143.8MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:31:05,302 INFO L158 Benchmark]: Boogie Preprocessor took 67.53ms. Allocated memory is still 218.1MB. Free memory was 143.8MB in the beginning and 139.1MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:31:05,302 INFO L158 Benchmark]: RCFGBuilder took 585.25ms. Allocated memory is still 218.1MB. Free memory was 139.1MB in the beginning and 173.4MB in the end (delta: -34.3MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. [2023-12-16 04:31:05,303 INFO L158 Benchmark]: TraceAbstraction took 28934.19ms. Allocated memory was 218.1MB in the beginning and 672.1MB in the end (delta: 454.0MB). Free memory was 172.9MB in the beginning and 303.6MB in the end (delta: -130.7MB). Peak memory consumption was 323.8MB. Max. memory is 8.0GB. [2023-12-16 04:31:05,304 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory was 127.6MB in the beginning and 127.6MB in the end (delta: 86.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 264.53ms. Allocated memory is still 218.1MB. Free memory was 163.9MB in the beginning and 147.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.01ms. Allocated memory is still 218.1MB. Free memory was 147.6MB in the beginning and 143.8MB in the end (delta: 3.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.53ms. Allocated memory is still 218.1MB. Free memory was 143.8MB in the beginning and 139.1MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 585.25ms. Allocated memory is still 218.1MB. Free memory was 139.1MB in the beginning and 173.4MB in the end (delta: -34.3MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. * TraceAbstraction took 28934.19ms. Allocated memory was 218.1MB in the beginning and 672.1MB in the end (delta: 454.0MB). Free memory was 172.9MB in the beginning and 303.6MB in the end (delta: -130.7MB). Peak memory consumption was 323.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of bitwise operation at line 115. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 32, 2, 8, 0, 32, 10, 1000000.625, 16.65, 15.5, 500, 8, 0, 100, 0, 0, 2.4 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 32, 2, 8, 0, 32, 10, 1000000.625, 16.65, 15.5, 500, 8, 0, 100, 0, 0, 2.4 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 32, 2, 8, 0, 32, 10, 1000000.625, 16.65, 15.5, 500, 8, 0, 100, 0, 0, 2.4 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 32, 2, 8, 0, 32, 10, 1000000.625, 16.65, 15.5, 500, 8, 0, 100, 0, 0, 2.4 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 32, 2, 8, 0, 32, 10, 1000000.625, 16.65, 15.5, 500, 8, 0, 100, 0, 0, 2.4 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 32, 2, 8, 0, 32, 10, 1000000.625, 16.65, 15.5, 500, 8, 0, 100, 0, 0, 2.4 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 32, 2, 8, 0, 32, 10, 1000000.625, 16.65, 15.5, 500, 8, 0, 100, 0, 0, 2.4 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 32, 2, 8, 0, 32, 10, 1000000.625, 16.65, 15.5, 500, 8, 0, 100, 0, 0, 2.4 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 32, 2, 8, 0, 32, 10, 1000000.625, 16.65, 15.5, 500, 8, 0, 100, 0, 0, 2.4 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 32, 2, 8, 0, 32, 10, 1000000.625, 16.65, 15.5, 500, 8, 0, 100, 0, 0, 2.4 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 32, 2, 8, 0, 32, 10, 1000000.625, 16.65, 15.5, 500, 8, 0, 100, 0, 0, 2.4 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 32, 2, 8, 0, 32, 10, 1000000.625, 16.65, 15.5, 500, 8, 0, 100, 0, 0, 2.4 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 32, 2, 8, 0, 32, 10, 1000000.625, 16.65, 15.5, 500, 8, 0, 100, 0, 0, 2.4 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 32, 2, 8, 0, 32, 10, 1000000.625, 16.65, 15.5, 500, 8, 0, 100, 0, 0, 2.4 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 32, 2, 8, 0, 32, 10, 1000000.625, 16.65, 15.5, 500, 8, 0, 100, 0, 0, 2.4 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 32, 2, 8, 0, 32, 10, 1000000.625, 16.65, 15.5, 500, 8, 0, 100, 0, 0, 2.4 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 32, 2, 8, 0, 32, 10, 1000000.625, 16.65, 15.5, 500, 8, 0, 100, 0, 0, 2.4 }; [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] FCALL updateLastVariables() [L123] CALL updateVariables() [L82] WrapperStruct00.var_1_2 = __VERIFIER_nondet_char() [L83] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] WrapperStruct00.var_1_3 = __VERIFIER_nondet_char() [L86] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L89] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L92] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L95] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_8 [L98] EXPR WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L100] EXPR WrapperStruct00.var_1_9 [L100] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_9 [L100] EXPR WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR (WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ushort() [L102] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L123] RET updateVariables() [L124] CALL step() [L62] EXPR WrapperStruct00.var_1_2 [L62] EXPR WrapperStruct00.var_1_3 [L62] EXPR WrapperStruct00.var_1_4 [L62] EXPR WrapperStruct00.var_1_5 [L62] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L62] EXPR ((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6)) [L62] EXPR WrapperStruct00.var_1_4 [L62] EXPR ((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L62] WrapperStruct00.var_1_1 = ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))) [L63] EXPR WrapperStruct00.var_1_5 [L63] EXPR WrapperStruct00.var_1_6 [L63] EXPR WrapperStruct00.var_1_3 [L63] EXPR WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3 [L63] signed long int stepLocal_0 = (~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3); [L64] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L64] COND TRUE stepLocal_0 >= WrapperStruct00.var_1_4 [L65] EXPR WrapperStruct00.var_1_8 [L65] WrapperStruct00.var_1_7 = WrapperStruct00.var_1_8 [L69] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L69] EXPR ((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2) [L69] EXPR WrapperStruct00.var_1_2 [L69] EXPR ((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=137438953472] [L69] WrapperStruct00.var_1_10 = ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2))) [L70] EXPR WrapperStruct00.var_1_6 [L70] EXPR WrapperStruct00.var_1_14 [L70] signed long int stepLocal_1 = WrapperStruct00.var_1_6 / WrapperStruct00.var_1_14; [L71] COND FALSE !(stepLocal_1 < -100) [L74] EXPR WrapperStruct00.var_1_15 [L74] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=137438953472, stepLocal_1=0] [L74] EXPR WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L74] WrapperStruct00.var_1_13 = (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16) [L76] EXPR WrapperStruct00.var_1_8 [L76] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_8 [L77] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L77] COND TRUE ! WrapperStruct00.var_1_13 [L78] EXPR WrapperStruct00.var_1_5 [L78] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L78] EXPR ((WrapperStruct00.var_1_6) > (1)) ? (WrapperStruct00.var_1_6) : (1) [L78] EXPR WrapperStruct00.var_1_6 [L78] EXPR ((WrapperStruct00.var_1_6) > (1)) ? (WrapperStruct00.var_1_6) : (1) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=137438953472, stepLocal_1=0] [L78] WrapperStruct00.var_1_11 = (WrapperStruct00.var_1_5 + (((((WrapperStruct00.var_1_6) > (1)) ? (WrapperStruct00.var_1_6) : (1))) + 64)) [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR WrapperStruct00.var_1_1 [L115] EXPR WrapperStruct00.var_1_2 [L115] EXPR WrapperStruct00.var_1_3 [L115] EXPR WrapperStruct00.var_1_4 [L115] EXPR WrapperStruct00.var_1_5 [L115] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR ((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6)) [L115] EXPR WrapperStruct00.var_1_4 [L115] EXPR ((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9))) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9))) [L115] EXPR WrapperStruct00.var_1_5 [L115] EXPR WrapperStruct00.var_1_6 [L115] EXPR WrapperStruct00.var_1_3 [L115] EXPR WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3 [L115] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9)) [L115] EXPR WrapperStruct00.var_1_7 [L115] EXPR WrapperStruct00.var_1_8 [L115] EXPR (((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9)) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9))) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR ((WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_10 == ((signed short int) ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR ((WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_10 == ((signed short int) ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (((WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_10 == ((signed short int) ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_5 + (((((WrapperStruct00.var_1_6) > (1)) ? (WrapperStruct00.var_1_6) : (1))) + 64)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (((WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_10 == ((signed short int) ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_5 + (((((WrapperStruct00.var_1_6) > (1)) ? (WrapperStruct00.var_1_6) : (1))) + 64)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR ((((WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_10 == ((signed short int) ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_5 + (((((WrapperStruct00.var_1_6) > (1)) ? (WrapperStruct00.var_1_6) : (1))) + 64)))) : 1)) && (((WrapperStruct00.var_1_6 / WrapperStruct00.var_1_14) < -100) ? (WrapperStruct00.var_1_13 == ((unsigned char) (! (! (! WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR ((((WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_10 == ((signed short int) ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_5 + (((((WrapperStruct00.var_1_6) > (1)) ? (WrapperStruct00.var_1_6) : (1))) + 64)))) : 1)) && (((WrapperStruct00.var_1_6 / WrapperStruct00.var_1_14) < -100) ? (WrapperStruct00.var_1_13 == ((unsigned char) (! (! (! WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (((((WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_10 == ((signed short int) ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_5 + (((((WrapperStruct00.var_1_6) > (1)) ? (WrapperStruct00.var_1_6) : (1))) + 64)))) : 1)) && (((WrapperStruct00.var_1_6 / WrapperStruct00.var_1_14) < -100) ? (WrapperStruct00.var_1_13 == ((unsigned char) (! (! (! WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] EXPR (((((WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_10 == ((signed short int) ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_5 + (((((WrapperStruct00.var_1_6) > (1)) ? (WrapperStruct00.var_1_6) : (1))) + 64)))) : 1)) && (((WrapperStruct00.var_1_6 / WrapperStruct00.var_1_14) < -100) ? (WrapperStruct00.var_1_13 == ((unsigned char) (! (! (! WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1] [L115-L116] return (((((WrapperStruct00.var_1_1 == ((signed char) ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3) - ((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_6))))))) && ((((~ WrapperStruct00.var_1_5) * (WrapperStruct00.var_1_6 & WrapperStruct00.var_1_3)) >= WrapperStruct00.var_1_4) ? (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_8)) : (WrapperStruct00.var_1_7 == ((double) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_10 == ((signed short int) ((((WrapperStruct00.var_1_2) < 0 ) ? -(WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_2)))))) && ((! WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_5 + (((((WrapperStruct00.var_1_6) > (1)) ? (WrapperStruct00.var_1_6) : (1))) + 64)))) : 1)) && (((WrapperStruct00.var_1_6 / WrapperStruct00.var_1_14) < -100) ? (WrapperStruct00.var_1_13 == ((unsigned char) (! (! (! WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_13 == ((unsigned char) (WrapperStruct00.var_1_15 && WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_8)) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.8s, OverallIterations: 12, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1621 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1592 mSDsluCounter, 4613 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3421 mSDsCounter, 311 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3710 IncrementalHoareTripleChecker+Invalid, 4021 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 311 mSolverCounterUnsat, 1192 mSDtfsCounter, 3710 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2302 GetRequests, 2115 SyntacticMatches, 8 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1440 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=6, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 277 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 2060 NumberOfCodeBlocks, 2060 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2189 ConstructedInterpolants, 1 QuantifiedInterpolants, 27934 SizeOfPredicates, 96 NumberOfNonLiveVariables, 5438 ConjunctsInSsa, 370 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 9687/10260 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-16 04:31:05,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...