/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 22:21:42,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 22:21:43,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 22:21:43,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 22:21:43,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 22:21:43,065 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 22:21:43,066 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 22:21:43,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 22:21:43,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 22:21:43,070 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 22:21:43,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 22:21:43,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 22:21:43,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 22:21:43,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 22:21:43,073 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 22:21:43,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 22:21:43,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 22:21:43,073 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 22:21:43,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 22:21:43,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 22:21:43,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 22:21:43,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 22:21:43,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 22:21:43,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 22:21:43,075 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 22:21:43,075 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 22:21:43,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 22:21:43,076 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 22:21:43,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 22:21:43,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 22:21:43,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 22:21:43,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 22:21:43,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:21:43,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 22:21:43,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 22:21:43,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 22:21:43,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 22:21:43,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 22:21:43,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 22:21:43,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 22:21:43,079 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 22:21:43,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 22:21:43,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 22:21:43,080 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 22:21:43,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 22:21:43,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 22:21:43,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 22:21:43,324 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 22:21:43,324 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 22:21:43,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-ll_valuebound1.c [2023-12-15 22:21:44,483 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 22:21:44,672 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 22:21:44,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_valuebound1.c [2023-12-15 22:21:44,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e3a232e/1ce862fe8e6541208613ad0d7c74250f/FLAGd7a2b3f08 [2023-12-15 22:21:44,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3e3a232e/1ce862fe8e6541208613ad0d7c74250f [2023-12-15 22:21:44,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 22:21:44,698 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 22:21:44,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 22:21:44,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 22:21:44,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 22:21:44,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:21:44" (1/1) ... [2023-12-15 22:21:44,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6481647c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:21:44, skipping insertion in model container [2023-12-15 22:21:44,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:21:44" (1/1) ... [2023-12-15 22:21:44,728 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 22:21:44,860 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_valuebound1.c[538,551] [2023-12-15 22:21:44,874 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:21:44,884 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 22:21:44,892 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_valuebound1.c[538,551] [2023-12-15 22:21:44,899 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:21:44,910 INFO L206 MainTranslator]: Completed translation [2023-12-15 22:21:44,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:21:44 WrapperNode [2023-12-15 22:21:44,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 22:21:44,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 22:21:44,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 22:21:44,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 22:21:44,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:21:44" (1/1) ... [2023-12-15 22:21:44,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:21:44" (1/1) ... [2023-12-15 22:21:44,937 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2023-12-15 22:21:44,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 22:21:44,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 22:21:44,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 22:21:44,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 22:21:44,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:21:44" (1/1) ... [2023-12-15 22:21:44,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:21:44" (1/1) ... [2023-12-15 22:21:44,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:21:44" (1/1) ... [2023-12-15 22:21:44,957 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 22:21:44,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:21:44" (1/1) ... [2023-12-15 22:21:44,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:21:44" (1/1) ... [2023-12-15 22:21:44,960 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:21:44" (1/1) ... [2023-12-15 22:21:44,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:21:44" (1/1) ... [2023-12-15 22:21:44,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:21:44" (1/1) ... [2023-12-15 22:21:44,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:21:44" (1/1) ... [2023-12-15 22:21:44,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 22:21:44,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 22:21:44,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 22:21:44,966 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 22:21:44,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:21:44" (1/1) ... [2023-12-15 22:21:44,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:21:44,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:21:44,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 22:21:45,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 22:21:45,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 22:21:45,018 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 22:21:45,018 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 22:21:45,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 22:21:45,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 22:21:45,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 22:21:45,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-15 22:21:45,019 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-15 22:21:45,064 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 22:21:45,066 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 22:21:45,249 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 22:21:45,269 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 22:21:45,270 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-15 22:21:45,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:21:45 BoogieIcfgContainer [2023-12-15 22:21:45,270 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 22:21:45,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 22:21:45,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 22:21:45,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 22:21:45,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:21:44" (1/3) ... [2023-12-15 22:21:45,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a9eb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:21:45, skipping insertion in model container [2023-12-15 22:21:45,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:21:44" (2/3) ... [2023-12-15 22:21:45,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a9eb84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:21:45, skipping insertion in model container [2023-12-15 22:21:45,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:21:45" (3/3) ... [2023-12-15 22:21:45,278 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound1.c [2023-12-15 22:21:45,290 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 22:21:45,291 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 22:21:45,328 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 22:21:45,334 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;@62a85ebd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 22:21:45,334 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 22:21:45,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-15 22:21:45,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-15 22:21:45,345 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:21:45,345 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:21:45,346 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:21:45,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:21:45,350 INFO L85 PathProgramCache]: Analyzing trace with hash 760957734, now seen corresponding path program 1 times [2023-12-15 22:21:45,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:21:45,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849362747] [2023-12-15 22:21:45,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:21:45,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:21:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:21:45,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:21:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:21:45,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:21:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:21:45,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:21:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:21:45,520 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 22:21:45,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:21:45,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849362747] [2023-12-15 22:21:45,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849362747] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:21:45,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:21:45,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 22:21:45,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357435409] [2023-12-15 22:21:45,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:21:45,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 22:21:45,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:21:45,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 22:21:45,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 22:21:45,562 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-15 22:21:45,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:21:45,586 INFO L93 Difference]: Finished difference Result 58 states and 99 transitions. [2023-12-15 22:21:45,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 22:21:45,589 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-12-15 22:21:45,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:21:45,593 INFO L225 Difference]: With dead ends: 58 [2023-12-15 22:21:45,593 INFO L226 Difference]: Without dead ends: 28 [2023-12-15 22:21:45,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 22:21:45,598 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:21:45,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:21:45,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-15 22:21:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-15 22:21:45,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 22:21:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2023-12-15 22:21:45,631 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 23 [2023-12-15 22:21:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:21:45,631 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2023-12-15 22:21:45,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-15 22:21:45,632 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2023-12-15 22:21:45,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-15 22:21:45,633 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:21:45,633 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:21:45,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 22:21:45,634 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:21:45,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:21:45,634 INFO L85 PathProgramCache]: Analyzing trace with hash -387749596, now seen corresponding path program 1 times [2023-12-15 22:21:45,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:21:45,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217524281] [2023-12-15 22:21:45,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:21:45,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:21:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:21:45,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:21:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:21:45,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:21:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:21:45,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:21:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:21:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 22:21:45,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:21:45,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217524281] [2023-12-15 22:21:45,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217524281] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:21:45,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:21:45,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 22:21:45,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332719965] [2023-12-15 22:21:45,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:21:45,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 22:21:45,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:21:45,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 22:21:45,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 22:21:45,868 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-15 22:21:45,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:21:45,918 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2023-12-15 22:21:45,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 22:21:45,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-12-15 22:21:45,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:21:45,920 INFO L225 Difference]: With dead ends: 41 [2023-12-15 22:21:45,920 INFO L226 Difference]: Without dead ends: 39 [2023-12-15 22:21:45,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:21:45,922 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:21:45,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 118 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:21:45,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-15 22:21:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2023-12-15 22:21:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 22:21:45,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2023-12-15 22:21:45,932 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2023-12-15 22:21:45,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:21:45,933 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2023-12-15 22:21:45,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-15 22:21:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2023-12-15 22:21:45,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-15 22:21:45,934 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:21:45,934 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:21:45,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 22:21:45,934 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:21:45,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:21:45,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1391236353, now seen corresponding path program 1 times [2023-12-15 22:21:45,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:21:45,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767773079] [2023-12-15 22:21:45,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:21:45,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:21:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:21:46,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:21:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:21:46,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:21:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:21:46,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:21:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:21:46,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-15 22:21:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:21:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 22:21:46,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:21:46,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767773079] [2023-12-15 22:21:46,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767773079] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:21:46,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:21:46,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 22:21:46,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051601782] [2023-12-15 22:21:46,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:21:46,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 22:21:46,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:21:46,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 22:21:46,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 22:21:46,129 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 22:21:46,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:21:46,206 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2023-12-15 22:21:46,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 22:21:46,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-12-15 22:21:46,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:21:46,210 INFO L225 Difference]: With dead ends: 45 [2023-12-15 22:21:46,210 INFO L226 Difference]: Without dead ends: 43 [2023-12-15 22:21:46,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:21:46,214 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:21:46,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 114 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:21:46,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-15 22:21:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2023-12-15 22:21:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-15 22:21:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2023-12-15 22:21:46,233 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2023-12-15 22:21:46,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:21:46,234 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2023-12-15 22:21:46,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-15 22:21:46,234 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2023-12-15 22:21:46,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-15 22:21:46,235 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:21:46,235 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:21:46,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 22:21:46,235 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:21:46,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:21:46,236 INFO L85 PathProgramCache]: Analyzing trace with hash 831418820, now seen corresponding path program 1 times [2023-12-15 22:21:46,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:21:46,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797293343] [2023-12-15 22:21:46,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:21:46,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:21:46,251 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 22:21:46,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394291560] [2023-12-15 22:21:46,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:21:46,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:21:46,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:21:46,258 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-15 22:21:46,264 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-15 22:21:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:21:46,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-15 22:21:46,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:21:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-15 22:21:46,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:21:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-15 22:21:46,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:21:46,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797293343] [2023-12-15 22:21:46,798 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 22:21:46,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394291560] [2023-12-15 22:21:46,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394291560] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:21:46,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 22:21:46,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2023-12-15 22:21:46,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670818805] [2023-12-15 22:21:46,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 22:21:46,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-15 22:21:46,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:21:46,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-15 22:21:46,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-12-15 22:21:46,802 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2023-12-15 22:21:47,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:21:47,036 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2023-12-15 22:21:47,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 22:21:47,036 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 33 [2023-12-15 22:21:47,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:21:47,039 INFO L225 Difference]: With dead ends: 68 [2023-12-15 22:21:47,039 INFO L226 Difference]: Without dead ends: 53 [2023-12-15 22:21:47,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-12-15 22:21:47,046 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 41 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:21:47,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 127 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:21:47,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-15 22:21:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2023-12-15 22:21:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-15 22:21:47,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2023-12-15 22:21:47,071 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 33 [2023-12-15 22:21:47,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:21:47,071 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2023-12-15 22:21:47,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 11 states have internal predecessors, (25), 6 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2023-12-15 22:21:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2023-12-15 22:21:47,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-15 22:21:47,076 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:21:47,076 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:21:47,087 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-15 22:21:47,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:21:47,282 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:21:47,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:21:47,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1016562388, now seen corresponding path program 1 times [2023-12-15 22:21:47,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:21:47,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972418625] [2023-12-15 22:21:47,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:21:47,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:21:47,292 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 22:21:47,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1764650451] [2023-12-15 22:21:47,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:21:47,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:21:47,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:21:47,294 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-15 22:21:47,312 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-15 22:21:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:21:47,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-15 22:21:47,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:21:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-15 22:21:47,548 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 22:21:47,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:21:47,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972418625] [2023-12-15 22:21:47,548 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 22:21:47,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764650451] [2023-12-15 22:21:47,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764650451] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:21:47,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:21:47,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 22:21:47,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738648127] [2023-12-15 22:21:47,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:21:47,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 22:21:47,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:21:47,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 22:21:47,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-15 22:21:47,550 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-15 22:21:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:21:47,711 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2023-12-15 22:21:47,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 22:21:47,711 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2023-12-15 22:21:47,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:21:47,714 INFO L225 Difference]: With dead ends: 63 [2023-12-15 22:21:47,716 INFO L226 Difference]: Without dead ends: 52 [2023-12-15 22:21:47,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:21:47,721 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 20 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:21:47,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 148 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:21:47,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-15 22:21:47,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-12-15 22:21:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-15 22:21:47,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2023-12-15 22:21:47,735 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 40 [2023-12-15 22:21:47,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:21:47,737 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2023-12-15 22:21:47,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-15 22:21:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2023-12-15 22:21:47,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-15 22:21:47,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:21:47,738 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:21:47,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 22:21:47,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:21:47,951 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:21:47,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:21:47,952 INFO L85 PathProgramCache]: Analyzing trace with hash 2057146835, now seen corresponding path program 1 times [2023-12-15 22:21:47,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:21:47,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660470553] [2023-12-15 22:21:47,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:21:47,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:21:47,967 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 22:21:47,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [519956933] [2023-12-15 22:21:47,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:21:47,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:21:47,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:21:47,969 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-15 22:21:47,978 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-15 22:21:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:21:48,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-15 22:21:48,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:21:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-15 22:21:48,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:21:48,548 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-15 22:21:48,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:21:48,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660470553] [2023-12-15 22:21:48,549 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 22:21:48,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519956933] [2023-12-15 22:21:48,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519956933] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:21:48,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 22:21:48,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2023-12-15 22:21:48,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048296842] [2023-12-15 22:21:48,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 22:21:48,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-15 22:21:48,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:21:48,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-15 22:21:48,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-12-15 22:21:48,554 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 8 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2023-12-15 22:21:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:21:48,867 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2023-12-15 22:21:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 22:21:48,867 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 8 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) Word has length 57 [2023-12-15 22:21:48,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:21:48,871 INFO L225 Difference]: With dead ends: 102 [2023-12-15 22:21:48,871 INFO L226 Difference]: Without dead ends: 85 [2023-12-15 22:21:48,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2023-12-15 22:21:48,872 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 22:21:48,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 212 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 22:21:48,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-12-15 22:21:48,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2023-12-15 22:21:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 50 states have internal predecessors, (56), 19 states have call successors, (19), 10 states have call predecessors, (19), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 22:21:48,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2023-12-15 22:21:48,898 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 57 [2023-12-15 22:21:48,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:21:48,898 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2023-12-15 22:21:48,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 8 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 7 states have call predecessors, (17), 6 states have call successors, (17) [2023-12-15 22:21:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2023-12-15 22:21:48,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-15 22:21:48,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:21:48,904 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:21:48,912 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-15 22:21:49,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:21:49,109 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:21:49,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:21:49,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1282123871, now seen corresponding path program 1 times [2023-12-15 22:21:49,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:21:49,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156934402] [2023-12-15 22:21:49,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:21:49,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:21:49,119 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 22:21:49,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1974908335] [2023-12-15 22:21:49,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:21:49,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:21:49,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:21:49,120 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-15 22:21:49,148 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-15 22:21:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:21:49,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 38 conjunts are in the unsatisfiable core [2023-12-15 22:21:49,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:21:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-12-15 22:21:49,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:21:51,058 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-15 22:21:51,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:21:51,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156934402] [2023-12-15 22:21:51,058 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 22:21:51,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974908335] [2023-12-15 22:21:51,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974908335] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:21:51,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 22:21:51,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2023-12-15 22:21:51,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684884835] [2023-12-15 22:21:51,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 22:21:51,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-15 22:21:51,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:21:51,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-15 22:21:51,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2023-12-15 22:21:51,060 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 10 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 9 states have call predecessors, (21), 8 states have call successors, (21) [2023-12-15 22:21:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:21:51,532 INFO L93 Difference]: Finished difference Result 91 states and 108 transitions. [2023-12-15 22:21:51,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 22:21:51,533 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 10 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 9 states have call predecessors, (21), 8 states have call successors, (21) Word has length 70 [2023-12-15 22:21:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:21:51,534 INFO L225 Difference]: With dead ends: 91 [2023-12-15 22:21:51,534 INFO L226 Difference]: Without dead ends: 87 [2023-12-15 22:21:51,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2023-12-15 22:21:51,535 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 72 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 22:21:51,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 205 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 22:21:51,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-15 22:21:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2023-12-15 22:21:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 22:21:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2023-12-15 22:21:51,553 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 70 [2023-12-15 22:21:51,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:21:51,555 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2023-12-15 22:21:51,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 10 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 9 states have call predecessors, (21), 8 states have call successors, (21) [2023-12-15 22:21:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2023-12-15 22:21:51,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-15 22:21:51,561 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:21:51,561 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:21:51,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 22:21:51,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:21:51,766 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:21:51,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:21:51,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1411586487, now seen corresponding path program 1 times [2023-12-15 22:21:51,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:21:51,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624968018] [2023-12-15 22:21:51,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:21:51,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:21:51,781 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 22:21:51,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [265567309] [2023-12-15 22:21:51,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:21:51,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:21:51,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:21:51,783 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-15 22:21:51,803 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-15 22:21:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:21:51,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-15 22:21:51,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:21:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-12-15 22:21:52,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:21:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2023-12-15 22:21:54,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:21:54,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624968018] [2023-12-15 22:21:54,433 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 22:21:54,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265567309] [2023-12-15 22:21:54,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265567309] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:21:54,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 22:21:54,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2023-12-15 22:21:54,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008466360] [2023-12-15 22:21:54,433 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 22:21:54,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-15 22:21:54,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:21:54,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-15 22:21:54,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2023-12-15 22:21:54,435 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 21 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 12 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 11 states have call predecessors, (25), 10 states have call successors, (25) [2023-12-15 22:21:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:21:56,479 INFO L93 Difference]: Finished difference Result 146 states and 180 transitions. [2023-12-15 22:21:56,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-15 22:21:56,484 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 12 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 11 states have call predecessors, (25), 10 states have call successors, (25) Word has length 81 [2023-12-15 22:21:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:21:56,486 INFO L225 Difference]: With dead ends: 146 [2023-12-15 22:21:56,486 INFO L226 Difference]: Without dead ends: 107 [2023-12-15 22:21:56,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=225, Invalid=897, Unknown=0, NotChecked=0, Total=1122 [2023-12-15 22:21:56,487 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 56 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-15 22:21:56,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 274 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-15 22:21:56,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-15 22:21:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2023-12-15 22:21:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 58 states have (on average 1.103448275862069) internal successors, (64), 58 states have internal predecessors, (64), 23 states have call successors, (23), 12 states have call predecessors, (23), 11 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-15 22:21:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2023-12-15 22:21:56,514 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 81 [2023-12-15 22:21:56,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:21:56,515 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2023-12-15 22:21:56,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.0) internal successors, (36), 17 states have internal predecessors, (36), 12 states have call successors, (26), 3 states have call predecessors, (26), 2 states have return successors, (25), 11 states have call predecessors, (25), 10 states have call successors, (25) [2023-12-15 22:21:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2023-12-15 22:21:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-15 22:21:56,516 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:21:56,516 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:21:56,526 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-15 22:21:56,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:21:56,722 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:21:56,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:21:56,722 INFO L85 PathProgramCache]: Analyzing trace with hash 924515754, now seen corresponding path program 2 times [2023-12-15 22:21:56,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:21:56,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571993697] [2023-12-15 22:21:56,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:21:56,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:21:56,739 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 22:21:56,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1336622980] [2023-12-15 22:21:56,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 22:21:56,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:21:56,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:21:56,740 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-15 22:21:56,763 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-15 22:21:56,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 22:21:56,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 22:21:56,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-15 22:21:56,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:21:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 234 proven. 21 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2023-12-15 22:21:56,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:21:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2023-12-15 22:21:57,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:21:57,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571993697] [2023-12-15 22:21:57,139 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 22:21:57,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336622980] [2023-12-15 22:21:57,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336622980] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:21:57,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 22:21:57,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-12-15 22:21:57,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272620745] [2023-12-15 22:21:57,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 22:21:57,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 22:21:57,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:21:57,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 22:21:57,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-15 22:21:57,141 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 9 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 8 states have call predecessors, (25), 9 states have call successors, (25) [2023-12-15 22:21:57,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:21:57,287 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2023-12-15 22:21:57,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 22:21:57,288 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 9 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 8 states have call predecessors, (25), 9 states have call successors, (25) Word has length 111 [2023-12-15 22:21:57,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:21:57,288 INFO L225 Difference]: With dead ends: 97 [2023-12-15 22:21:57,288 INFO L226 Difference]: Without dead ends: 0 [2023-12-15 22:21:57,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2023-12-15 22:21:57,289 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:21:57,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 173 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:21:57,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-15 22:21:57,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-15 22:21:57,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:21:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-15 22:21:57,290 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2023-12-15 22:21:57,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:21:57,291 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-15 22:21:57,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 9 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (25), 8 states have call predecessors, (25), 9 states have call successors, (25) [2023-12-15 22:21:57,291 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-15 22:21:57,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-15 22:21:57,293 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 22:21:57,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-15 22:21:57,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:21:57,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-15 22:21:58,057 INFO L895 garLoopResultBuilder]: At program point L60(line 60) the Hoare annotation is: (and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)) [2023-12-15 22:21:58,058 INFO L899 garLoopResultBuilder]: For program point L48(lines 46 58) no Hoare annotation was computed. [2023-12-15 22:21:58,058 INFO L895 garLoopResultBuilder]: At program point L36-2(lines 36 44) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~r~0#1| 1)) (.cse1 (= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))) (or (and (<= (+ 2 (* (div (+ (- 1) |ULTIMATE.start_main_~d~0#1|) 4) 2)) |ULTIMATE.start_main_~r~0#1|) .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~d~0#1|)) (and (= 2 |ULTIMATE.start_main_~p~0#1|) .cse1 .cse2 (= |ULTIMATE.start_main_~r~0#1| 1) .cse3 (= 2 |ULTIMATE.start_main_~d~0#1|)) (and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) .cse0 .cse1 .cse2 .cse3))) [2023-12-15 22:21:58,058 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2023-12-15 22:21:58,058 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 1) [2023-12-15 22:21:58,058 INFO L895 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: (and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (<= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) 1)) [2023-12-15 22:21:58,058 INFO L895 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~r~0#1| 1)) (.cse1 (= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))) (or (and (<= (+ 2 (* (div (+ (- 1) |ULTIMATE.start_main_~d~0#1|) 4) 2)) |ULTIMATE.start_main_~r~0#1|) .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~d~0#1|)) (and (= 2 |ULTIMATE.start_main_~p~0#1|) .cse1 .cse2 (= |ULTIMATE.start_main_~r~0#1| 1) .cse3 (= 2 |ULTIMATE.start_main_~d~0#1|)) (and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) .cse0 .cse1 .cse2 .cse3))) [2023-12-15 22:21:58,058 INFO L895 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~r~0#1| 1)) (.cse1 (= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))) (or (and (<= (+ 2 (* (div (+ (- 1) |ULTIMATE.start_main_~d~0#1|) 4) 2)) |ULTIMATE.start_main_~r~0#1|) .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~d~0#1|)) (and (= 2 |ULTIMATE.start_main_~p~0#1|) .cse1 .cse2 (= |ULTIMATE.start_main_~r~0#1| 1) .cse3 (= 2 |ULTIMATE.start_main_~d~0#1|)) (and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) .cse0 .cse1 .cse2 .cse3))) [2023-12-15 22:21:58,058 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-15 22:21:58,058 INFO L899 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2023-12-15 22:21:58,058 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 57) no Hoare annotation was computed. [2023-12-15 22:21:58,059 INFO L895 garLoopResultBuilder]: At program point L54-2(lines 46 58) the Hoare annotation is: (let ((.cse5 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse0 (= .cse5 1)) (.cse1 (= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1))) (or (and (= 2 |ULTIMATE.start_main_~p~0#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~r~0#1| 1) (= 2 |ULTIMATE.start_main_~d~0#1|)) (and .cse3 .cse4 .cse1 .cse2 (<= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| .cse5)) (and .cse3 .cse4 .cse0 .cse1 (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1))))) [2023-12-15 22:21:58,059 INFO L895 garLoopResultBuilder]: At program point L46-1(lines 46 58) the Hoare annotation is: (and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= (+ |ULTIMATE.start_main_~p~0#1| |ULTIMATE.start_main_~q~0#1| |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~d~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))) [2023-12-15 22:21:58,059 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-15 22:21:58,059 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (<= |ULTIMATE.start_main_~r~0#1| 1)) (.cse1 (= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)) (.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~r~0#1| (mod |ULTIMATE.start_main_~A~0#1| 4294967296)))) (or (and (<= (+ 2 (* (div (+ (- 1) |ULTIMATE.start_main_~d~0#1|) 4) 2)) |ULTIMATE.start_main_~r~0#1|) .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~p~0#1|) (<= 0 |ULTIMATE.start_main_~d~0#1|)) (and (= 2 |ULTIMATE.start_main_~p~0#1|) .cse1 .cse2 (= |ULTIMATE.start_main_~r~0#1| 1) .cse3 (= 2 |ULTIMATE.start_main_~d~0#1|)) (and (= |ULTIMATE.start_main_~d~0#1| 1) (= |ULTIMATE.start_main_~p~0#1| 1) .cse0 .cse1 .cse2 .cse3))) [2023-12-15 22:21:58,059 INFO L902 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: true [2023-12-15 22:21:58,059 INFO L899 garLoopResultBuilder]: For program point L26-1(line 26) no Hoare annotation was computed. [2023-12-15 22:21:58,059 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse5 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse0 (= .cse5 1)) (.cse1 (= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1))) (or (and (= 2 |ULTIMATE.start_main_~p~0#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~r~0#1| 1) (= 2 |ULTIMATE.start_main_~d~0#1|)) (and .cse3 .cse4 .cse1 .cse2 (<= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| .cse5)) (and .cse3 .cse4 .cse0 .cse1 (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1))))) [2023-12-15 22:21:58,059 INFO L895 garLoopResultBuilder]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse5 (mod |ULTIMATE.start_main_~A~0#1| 4294967296))) (let ((.cse2 (= |ULTIMATE.start_main_~q~0#1| 0)) (.cse3 (= |ULTIMATE.start_main_~d~0#1| 1)) (.cse4 (= |ULTIMATE.start_main_~p~0#1| 1)) (.cse0 (= .cse5 1)) (.cse1 (= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1))) (or (and (= 2 |ULTIMATE.start_main_~p~0#1|) .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~r~0#1| 1) (= 2 |ULTIMATE.start_main_~d~0#1|)) (and .cse3 .cse4 .cse1 .cse2 (<= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~r~0#1| .cse5)) (and .cse3 .cse4 .cse0 .cse1 (= |ULTIMATE.start_main_~r~0#1| 0) (= |ULTIMATE.start_main_~q~0#1| 1))))) [2023-12-15 22:21:58,059 INFO L899 garLoopResultBuilder]: For program point L39(lines 36 44) no Hoare annotation was computed. [2023-12-15 22:21:58,059 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2023-12-15 22:21:58,060 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2023-12-15 22:21:58,060 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 13) the Hoare annotation is: true [2023-12-15 22:21:58,060 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2023-12-15 22:21:58,060 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2023-12-15 22:21:58,060 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2023-12-15 22:21:58,060 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2023-12-15 22:21:58,060 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2023-12-15 22:21:58,060 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 14 20) the Hoare annotation is: true [2023-12-15 22:21:58,060 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2023-12-15 22:21:58,063 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:21:58,064 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 22:21:58,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 10:21:58 BoogieIcfgContainer [2023-12-15 22:21:58,078 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 22:21:58,078 INFO L158 Benchmark]: Toolchain (without parser) took 13380.51ms. Allocated memory was 323.0MB in the beginning and 399.5MB in the end (delta: 76.5MB). Free memory was 267.6MB in the beginning and 199.3MB in the end (delta: 68.3MB). Peak memory consumption was 145.3MB. Max. memory is 8.0GB. [2023-12-15 22:21:58,079 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 218.1MB. Free memory is still 168.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 22:21:58,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.20ms. Allocated memory is still 323.0MB. Free memory was 267.2MB in the beginning and 256.1MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-15 22:21:58,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.92ms. Allocated memory is still 323.0MB. Free memory was 256.1MB in the beginning and 254.4MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-15 22:21:58,079 INFO L158 Benchmark]: Boogie Preprocessor took 27.72ms. Allocated memory is still 323.0MB. Free memory was 254.4MB in the beginning and 252.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 22:21:58,080 INFO L158 Benchmark]: RCFGBuilder took 304.32ms. Allocated memory is still 323.0MB. Free memory was 252.5MB in the beginning and 240.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-15 22:21:58,080 INFO L158 Benchmark]: TraceAbstraction took 12805.77ms. Allocated memory was 323.0MB in the beginning and 399.5MB in the end (delta: 76.5MB). Free memory was 239.3MB in the beginning and 199.3MB in the end (delta: 40.0MB). Peak memory consumption was 117.0MB. Max. memory is 8.0GB. [2023-12-15 22:21:58,081 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 218.1MB. Free memory is still 168.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 210.20ms. Allocated memory is still 323.0MB. Free memory was 267.2MB in the beginning and 256.1MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.92ms. Allocated memory is still 323.0MB. Free memory was 256.1MB in the beginning and 254.4MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.72ms. Allocated memory is still 323.0MB. Free memory was 254.4MB in the beginning and 252.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 304.32ms. Allocated memory is still 323.0MB. Free memory was 252.5MB in the beginning and 240.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 12805.77ms. Allocated memory was 323.0MB in the beginning and 399.5MB in the end (delta: 76.5MB). Free memory was 239.3MB in the beginning and 199.3MB in the end (delta: 40.0MB). Peak memory consumption was 117.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 9, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 287 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 260 mSDsluCounter, 1409 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1160 mSDsCounter, 238 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1154 IncrementalHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 238 mSolverCounterUnsat, 249 mSDtfsCounter, 1154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 804 GetRequests, 678 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=8, InterpolantAutomatonStates: 95, 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, 9 MinimizatonAttempts, 41 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 66 PreInvPairs, 95 NumberOfFragments, 587 HoareAnnotationTreeSize, 66 FormulaSimplifications, 1764 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FormulaSimplificationsInter, 375 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 466 NumberOfCodeBlocks, 466 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 804 ConstructedInterpolants, 0 QuantifiedInterpolants, 5175 SizeOfPredicates, 31 NumberOfNonLiveVariables, 886 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 1910/2002 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((((((2 == p) && ((A % 4294967296) == 1)) && ((B % 4294967296) == 1)) && (q == 0)) && (r == 1)) && (2 == d)) || ((((((d == 1) && (p == 1)) && ((B % 4294967296) == 1)) && (q == 0)) && (r <= 0)) && (r == (A % 4294967296)))) || ((((((d == 1) && (p == 1)) && ((A % 4294967296) == 1)) && ((B % 4294967296) == 1)) && (r == 0)) && (q == 1))) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((2 + (((-1 + d) / 4) * 2)) <= r) && (r <= 1)) && ((B % 4294967296) == 1)) && (q == 0)) && (r == (A % 4294967296))) && (d == p)) && (0 <= d)) || ((((((2 == p) && ((B % 4294967296) == 1)) && (q == 0)) && (r == 1)) && (r == (A % 4294967296))) && (2 == d))) || ((((((d == 1) && (p == 1)) && (r <= 1)) && ((B % 4294967296) == 1)) && (q == 0)) && (r == (A % 4294967296)))) RESULT: Ultimate proved your program to be correct! [2023-12-15 22:21:58,114 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...