/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench/prod4br-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:31:45,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:31:45,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:31:45,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:31:45,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:31:45,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:31:45,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:31:45,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:31:45,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:31:45,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:31:45,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:31:45,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:31:45,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:31:45,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:31:45,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:31:45,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:31:45,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:31:45,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:31:45,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:31:45,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:31:45,569 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:31:45,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:31:45,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:31:45,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:31:45,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:31:45,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:31:45,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:31:45,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:31:45,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:31:45,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:31:45,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:31:45,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:31:45,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:31:45,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:31:45,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:31:45,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:31:45,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:31:45,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:31:45,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:31:45,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:31:45,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:31:45,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:31:45,584 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:31:45,590 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:31:45,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:31:45,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:31:45,591 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:31:45,591 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:31:45,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:31:45,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:31:45,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:31:45,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:31:45,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:31:45,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:31:45,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:31:45,591 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:31:45,592 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:31:45,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:31:45,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:31:45,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:31:45,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:31:45,592 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:31:45,592 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:31:45,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:31:45,592 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:31:45,592 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 13:31:45,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:31:45,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:31:45,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:31:45,733 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:31:45,737 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:31:45,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/prod4br-ll.c [2022-04-15 13:31:45,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f850f617/1b24c9c295a8433faebbabe737e68bb6/FLAGf8852a871 [2022-04-15 13:31:46,104 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:31:46,105 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prod4br-ll.c [2022-04-15 13:31:46,109 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f850f617/1b24c9c295a8433faebbabe737e68bb6/FLAGf8852a871 [2022-04-15 13:31:46,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f850f617/1b24c9c295a8433faebbabe737e68bb6 [2022-04-15 13:31:46,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:31:46,561 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:31:46,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:31:46,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:31:46,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:31:46,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:31:46" (1/1) ... [2022-04-15 13:31:46,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@612285fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:31:46, skipping insertion in model container [2022-04-15 13:31:46,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:31:46" (1/1) ... [2022-04-15 13:31:46,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:31:46,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:31:46,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prod4br-ll.c[524,537] [2022-04-15 13:31:46,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:31:46,710 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:31:46,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prod4br-ll.c[524,537] [2022-04-15 13:31:46,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:31:46,730 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:31:46,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:31:46 WrapperNode [2022-04-15 13:31:46,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:31:46,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:31:46,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:31:46,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:31:46,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:31:46" (1/1) ... [2022-04-15 13:31:46,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:31:46" (1/1) ... [2022-04-15 13:31:46,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:31:46" (1/1) ... [2022-04-15 13:31:46,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:31:46" (1/1) ... [2022-04-15 13:31:46,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:31:46" (1/1) ... [2022-04-15 13:31:46,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:31:46" (1/1) ... [2022-04-15 13:31:46,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:31:46" (1/1) ... [2022-04-15 13:31:46,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:31:46,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:31:46,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:31:46,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:31:46,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:31:46" (1/1) ... [2022-04-15 13:31:46,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:31:46,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:31:46,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 13:31:46,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 13:31:46,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:31:46,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:31:46,848 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:31:46,848 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:31:46,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:31:46,849 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:31:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:31:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:31:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:31:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:31:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 13:31:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:31:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:31:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:31:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:31:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:31:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:31:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:31:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:31:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:31:46,897 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:31:46,898 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:31:47,042 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:31:47,046 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:31:47,047 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 13:31:47,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:31:47 BoogieIcfgContainer [2022-04-15 13:31:47,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:31:47,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:31:47,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:31:47,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:31:47,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:31:46" (1/3) ... [2022-04-15 13:31:47,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edf0e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:31:47, skipping insertion in model container [2022-04-15 13:31:47,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:31:46" (2/3) ... [2022-04-15 13:31:47,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edf0e8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:31:47, skipping insertion in model container [2022-04-15 13:31:47,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:31:47" (3/3) ... [2022-04-15 13:31:47,053 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll.c [2022-04-15 13:31:47,055 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:31:47,055 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:31:47,079 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:31:47,083 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-15 13:31:47,083 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:31:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 13:31:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 13:31:47,097 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:31:47,098 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:31:47,098 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:31:47,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:31:47,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1051010973, now seen corresponding path program 1 times [2022-04-15 13:31:47,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:31:47,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [545132191] [2022-04-15 13:31:47,112 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:31:47,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1051010973, now seen corresponding path program 2 times [2022-04-15 13:31:47,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:31:47,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586682389] [2022-04-15 13:31:47,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:31:47,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:31:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:31:47,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:31:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:31:47,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-15 13:31:47,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 13:31:47,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #76#return; {34#true} is VALID [2022-04-15 13:31:47,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:31:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:31:47,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 13:31:47,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 13:31:47,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 13:31:47,258 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #68#return; {35#false} is VALID [2022-04-15 13:31:47,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:31:47,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-15 13:31:47,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 13:31:47,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #76#return; {34#true} is VALID [2022-04-15 13:31:47,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-15 13:31:47,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {34#true} is VALID [2022-04-15 13:31:47,260 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {34#true} is VALID [2022-04-15 13:31:47,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 13:31:47,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 13:31:47,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 13:31:47,260 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #68#return; {35#false} is VALID [2022-04-15 13:31:47,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {35#false} is VALID [2022-04-15 13:31:47,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-15 13:31:47,261 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {35#false} is VALID [2022-04-15 13:31:47,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-15 13:31:47,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-15 13:31:47,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-15 13:31:47,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:31:47,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:31:47,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586682389] [2022-04-15 13:31:47,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586682389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:31:47,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:31:47,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:31:47,265 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:31:47,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [545132191] [2022-04-15 13:31:47,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [545132191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:31:47,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:31:47,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:31:47,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248686762] [2022-04-15 13:31:47,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:31:47,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 13:31:47,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:31:47,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:31:47,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:31:47,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:31:47,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:31:47,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:31:47,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:31:47,320 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:31:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:31:47,455 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-04-15 13:31:47,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:31:47,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 13:31:47,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:31:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:31:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-15 13:31:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:31:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-04-15 13:31:47,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 73 transitions. [2022-04-15 13:31:47,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:31:47,562 INFO L225 Difference]: With dead ends: 53 [2022-04-15 13:31:47,562 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 13:31:47,564 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:31:47,566 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:31:47,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 35 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:31:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 13:31:47,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 13:31:47,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:31:47,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:31:47,587 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:31:47,587 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:31:47,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:31:47,590 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-15 13:31:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-15 13:31:47,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:31:47,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:31:47,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-15 13:31:47,591 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-15 13:31:47,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:31:47,593 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-15 13:31:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-15 13:31:47,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:31:47,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:31:47,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:31:47,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:31:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 13:31:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-15 13:31:47,597 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-15 13:31:47,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:31:47,597 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-15 13:31:47,597 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:31:47,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-15 13:31:47,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:31:47,626 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-15 13:31:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 13:31:47,627 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:31:47,627 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:31:47,627 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:31:47,627 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:31:47,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:31:47,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1732856803, now seen corresponding path program 1 times [2022-04-15 13:31:47,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:31:47,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [994904984] [2022-04-15 13:31:47,629 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:31:47,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1732856803, now seen corresponding path program 2 times [2022-04-15 13:31:47,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:31:47,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606526553] [2022-04-15 13:31:47,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:31:47,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:31:47,651 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:31:47,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2113824531] [2022-04-15 13:31:47,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:31:47,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:31:47,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:31:47,653 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) [2022-04-15 13:31:47,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 13:31:47,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 13:31:47,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:31:47,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 13:31:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:31:47,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:31:47,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2022-04-15 13:31:47,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-15 13:31:47,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-15 13:31:47,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #76#return; {256#true} is VALID [2022-04-15 13:31:47,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret6 := main(); {256#true} is VALID [2022-04-15 13:31:47,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {256#true} is VALID [2022-04-15 13:31:47,898 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {256#true} is VALID [2022-04-15 13:31:47,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-15 13:31:47,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-15 13:31:47,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-15 13:31:47,900 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #68#return; {256#true} is VALID [2022-04-15 13:31:47,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {294#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 13:31:47,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {294#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {294#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-15 13:31:47,902 INFO L272 TraceCheckUtils]: 13: Hoare triple {294#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {301#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:31:47,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {301#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {305#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:31:47,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {305#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {257#false} is VALID [2022-04-15 13:31:47,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-15 13:31:47,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:31:47,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:31:47,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:31:47,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606526553] [2022-04-15 13:31:47,904 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:31:47,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113824531] [2022-04-15 13:31:47,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113824531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:31:47,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:31:47,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:31:47,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:31:47,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [994904984] [2022-04-15 13:31:47,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [994904984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:31:47,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:31:47,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:31:47,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102587180] [2022-04-15 13:31:47,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:31:47,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 13:31:47,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:31:47,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:31:47,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:31:47,920 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:31:47,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:31:47,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:31:47,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:31:47,922 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:31:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:31:48,080 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-15 13:31:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:31:48,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 13:31:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:31:48,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:31:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-15 13:31:48,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:31:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-15 13:31:48,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-15 13:31:48,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:31:48,130 INFO L225 Difference]: With dead ends: 40 [2022-04-15 13:31:48,130 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 13:31:48,131 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:31:48,133 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 9 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:31:48,136 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 75 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:31:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 13:31:48,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-04-15 13:31:48,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:31:48,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:31:48,152 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:31:48,153 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:31:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:31:48,156 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-15 13:31:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-15 13:31:48,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:31:48,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:31:48,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-15 13:31:48,158 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-15 13:31:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:31:48,159 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-15 13:31:48,159 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-15 13:31:48,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:31:48,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:31:48,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:31:48,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:31:48,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 13:31:48,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-15 13:31:48,162 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 17 [2022-04-15 13:31:48,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:31:48,162 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-15 13:31:48,162 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 13:31:48,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-15 13:31:48,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:31:48,197 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-15 13:31:48,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 13:31:48,198 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:31:48,198 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:31:48,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 13:31:48,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:31:48,412 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:31:48,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:31:48,412 INFO L85 PathProgramCache]: Analyzing trace with hash -253409975, now seen corresponding path program 1 times [2022-04-15 13:31:48,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:31:48,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [57194668] [2022-04-15 13:31:48,413 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:31:48,413 INFO L85 PathProgramCache]: Analyzing trace with hash -253409975, now seen corresponding path program 2 times [2022-04-15 13:31:48,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:31:48,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236933257] [2022-04-15 13:31:48,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:31:48,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:31:48,426 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:31:48,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2076535952] [2022-04-15 13:31:48,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:31:48,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:31:48,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:31:48,439 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) [2022-04-15 13:31:48,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 13:31:48,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:31:48,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:31:48,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 13:31:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:31:48,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:31:57,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {533#true} call ULTIMATE.init(); {533#true} is VALID [2022-04-15 13:31:57,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {533#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {533#true} is VALID [2022-04-15 13:31:57,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {533#true} assume true; {533#true} is VALID [2022-04-15 13:31:57,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {533#true} {533#true} #76#return; {533#true} is VALID [2022-04-15 13:31:57,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {533#true} call #t~ret6 := main(); {533#true} is VALID [2022-04-15 13:31:57,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {533#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {533#true} is VALID [2022-04-15 13:31:57,091 INFO L272 TraceCheckUtils]: 6: Hoare triple {533#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {533#true} is VALID [2022-04-15 13:31:57,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {533#true} ~cond := #in~cond; {559#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 13:31:57,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {559#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {563#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 13:31:57,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {563#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {563#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 13:31:57,093 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {563#(not (= |assume_abort_if_not_#in~cond| 0))} {533#true} #68#return; {570#(<= 1 main_~y~0)} is VALID [2022-04-15 13:31:57,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {570#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {574#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 13:31:57,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {574#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !false; {574#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-15 13:31:57,094 INFO L272 TraceCheckUtils]: 13: Hoare triple {574#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {533#true} is VALID [2022-04-15 13:31:57,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {533#true} ~cond := #in~cond; {584#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:31:57,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {584#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {588#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:31:57,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {588#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {588#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:31:59,108 WARN L284 TraceCheckUtils]: 17: Hoare quadruple {588#(not (= |__VERIFIER_assert_#in~cond| 0))} {574#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #70#return; {595#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-15 13:31:59,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {595#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {599#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-15 13:31:59,110 INFO L272 TraceCheckUtils]: 19: Hoare triple {599#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:31:59,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:31:59,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {534#false} is VALID [2022-04-15 13:31:59,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {534#false} assume !false; {534#false} is VALID [2022-04-15 13:31:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:31:59,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:32:36,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {534#false} assume !false; {534#false} is VALID [2022-04-15 13:32:36,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {534#false} is VALID [2022-04-15 13:32:36,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:32:36,633 INFO L272 TraceCheckUtils]: 19: Hoare triple {623#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:32:36,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {627#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {623#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-15 13:32:36,636 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {588#(not (= |__VERIFIER_assert_#in~cond| 0))} {533#true} #70#return; {627#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-15 13:32:36,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {588#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {588#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:32:36,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {640#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {588#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:32:36,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {533#true} ~cond := #in~cond; {640#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:32:36,637 INFO L272 TraceCheckUtils]: 13: Hoare triple {533#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {533#true} is VALID [2022-04-15 13:32:36,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {533#true} assume !false; {533#true} is VALID [2022-04-15 13:32:36,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {533#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {533#true} is VALID [2022-04-15 13:32:36,637 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {533#true} {533#true} #68#return; {533#true} is VALID [2022-04-15 13:32:36,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {533#true} assume true; {533#true} is VALID [2022-04-15 13:32:36,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {533#true} assume !(0 == ~cond); {533#true} is VALID [2022-04-15 13:32:36,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {533#true} ~cond := #in~cond; {533#true} is VALID [2022-04-15 13:32:36,638 INFO L272 TraceCheckUtils]: 6: Hoare triple {533#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {533#true} is VALID [2022-04-15 13:32:36,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {533#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {533#true} is VALID [2022-04-15 13:32:36,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {533#true} call #t~ret6 := main(); {533#true} is VALID [2022-04-15 13:32:36,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {533#true} {533#true} #76#return; {533#true} is VALID [2022-04-15 13:32:36,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {533#true} assume true; {533#true} is VALID [2022-04-15 13:32:36,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {533#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {533#true} is VALID [2022-04-15 13:32:36,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {533#true} call ULTIMATE.init(); {533#true} is VALID [2022-04-15 13:32:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:32:36,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:32:36,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236933257] [2022-04-15 13:32:36,639 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:32:36,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076535952] [2022-04-15 13:32:36,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076535952] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:32:36,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 13:32:36,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-15 13:32:36,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:32:36,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [57194668] [2022-04-15 13:32:36,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [57194668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:32:36,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:32:36,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 13:32:36,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140578620] [2022-04-15 13:32:36,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:32:36,640 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 13:32:36,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:32:36,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:32:38,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 22 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:32:38,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 13:32:38,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:32:38,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 13:32:38,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:32:38,659 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:32:39,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:32:39,648 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-04-15 13:32:39,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 13:32:39,648 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 13:32:39,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:32:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:32:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2022-04-15 13:32:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:32:39,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2022-04-15 13:32:39,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 53 transitions. [2022-04-15 13:32:41,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:32:41,696 INFO L225 Difference]: With dead ends: 46 [2022-04-15 13:32:41,696 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 13:32:41,696 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-04-15 13:32:41,697 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 36 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:32:41,697 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 88 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 13:32:41,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 13:32:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-04-15 13:32:41,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:32:41,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 13:32:41,720 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 13:32:41,721 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 13:32:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:32:41,722 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-15 13:32:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-04-15 13:32:41,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:32:41,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:32:41,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-15 13:32:41,723 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-15 13:32:41,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:32:41,725 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-15 13:32:41,725 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2022-04-15 13:32:41,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:32:41,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:32:41,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:32:41,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:32:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 13:32:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2022-04-15 13:32:41,728 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 23 [2022-04-15 13:32:41,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:32:41,728 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2022-04-15 13:32:41,728 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:32:41,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 51 transitions. [2022-04-15 13:32:43,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:32:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-15 13:32:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 13:32:43,834 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:32:43,834 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:32:43,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 13:32:44,035 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 13:32:44,035 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:32:44,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:32:44,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1855333828, now seen corresponding path program 1 times [2022-04-15 13:32:44,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:32:44,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1116656967] [2022-04-15 13:32:50,155 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialTermUtils.applyModuloToAllCoefficients(PolynomialTermUtils.java:313) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.AffineTerm.applyModuloToAllCoefficients(AffineTerm.java:208) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.mod(SmtUtils.java:1867) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.termWithLocalSimplification(SmtUtils.java:1454) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.termWithLocalSimplification(SmtUtils.java:1378) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.convertApplicationTerm(SmtUtils.java:1367) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.convertApplicationTerm(Substitution.java:53) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractor.getUpdates(QvasrAbstractor.java:1247) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractor.computeAbstraction(QvasrAbstractor.java:110) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.summarizeLoop(QvasrSummarizer.java:129) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrLoopSummarization.getQvasrAcceleration(QvasrLoopSummarization.java:87) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorQvasr.accelerateLoop(AcceleratorQvasr.java:91) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 13:32:50,158 INFO L158 Benchmark]: Toolchain (without parser) took 63596.59ms. Allocated memory was 234.9MB in the beginning and 327.2MB in the end (delta: 92.3MB). Free memory was 186.9MB in the beginning and 293.5MB in the end (delta: -106.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:32:50,158 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 234.9MB. Free memory is still 202.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:32:50,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.40ms. Allocated memory is still 234.9MB. Free memory was 186.8MB in the beginning and 211.3MB in the end (delta: -24.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 13:32:50,159 INFO L158 Benchmark]: Boogie Preprocessor took 18.26ms. Allocated memory is still 234.9MB. Free memory was 211.3MB in the beginning and 209.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 13:32:50,159 INFO L158 Benchmark]: RCFGBuilder took 297.71ms. Allocated memory is still 234.9MB. Free memory was 209.8MB in the beginning and 197.2MB in the end (delta: 12.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 13:32:50,159 INFO L158 Benchmark]: TraceAbstraction took 63108.49ms. Allocated memory was 234.9MB in the beginning and 327.2MB in the end (delta: 92.3MB). Free memory was 196.6MB in the beginning and 293.5MB in the end (delta: -96.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:32:50,160 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 234.9MB. Free memory is still 202.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 168.40ms. Allocated memory is still 234.9MB. Free memory was 186.8MB in the beginning and 211.3MB in the end (delta: -24.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.26ms. Allocated memory is still 234.9MB. Free memory was 211.3MB in the beginning and 209.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 297.71ms. Allocated memory is still 234.9MB. Free memory was 209.8MB in the beginning and 197.2MB in the end (delta: 12.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 63108.49ms. Allocated memory was 234.9MB in the beginning and 327.2MB in the end (delta: 92.3MB). Free memory was 196.6MB in the beginning and 293.5MB in the end (delta: -96.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialTermUtils.applyModuloToAllCoefficients(PolynomialTermUtils.java:313) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 13:32:50,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...